Maximum Packing of Dt-P and Dt boolean OR P with Mendelsohn Triples

dc.citation.epage	182	en_US
dc.citation.issue		en_US
dc.citation.spage	165	en_US
dc.citation.volume	91	en_US
dc.citation.woscount	0
dc.contributor.author	Pu, Liqun	en_US
dc.contributor.author	Fu, Hung-Lin	en_US
dc.contributor.author	Shen, Hao	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.date.accessioned	2014-12-08T15:09:43Z
dc.date.available	2014-12-08T15:09:43Z
dc.date.issued	2009-04-01	en_US
dc.description.abstract	In this paper, we extend the study on packing and covering of complete directed graph D(t) with Mendelsohn triples [6]. Mainly, the maximum packing of D(t) - P and D(t) boolean OR P with Mendelsohn triples are obtained respectively where P is a vertex-disjoint union of directed cycles in D(t).	en_US
dc.identifier.issn	0381-7032	en_US
dc.identifier.journal	ARS COMBINATORIA	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/7439
dc.identifier.wosnumber	WOS:000264895000015
dc.language.iso	en_US	en_US
dc.subject	Mendelsohn triples	en_US
dc.subject	Complete digraph	en_US
dc.subject	Maximum Packing	en_US
dc.title	Maximum Packing of Dt-P and Dt boolean OR P with Mendelsohn Triples	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1