Full metadata record
DC FieldValueLanguage
dc.contributor.authorPu, Liqunen_US
dc.contributor.authorFu, Hung-Linen_US
dc.contributor.authorShen, Haoen_US
dc.date.accessioned2019-04-02T06:01:04Z-
dc.date.available2019-04-02T06:01:04Z-
dc.date.issued2006-12-01en_US
dc.identifier.issn0911-0119en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s00373-006-0683-yen_US
dc.identifier.urihttp://hdl.handle.net/11536/149124-
dc.description.abstractIn this paper, we extend the study of C-4-decompositions of the complete graph with 2-regular leaves and paddings to directed versions. Mainly, we prove that if P is a vertex-disjoint union of directed cycles in a complete digraph D-v, then D-v\P and D-v boolean OR Pcan be decomposed into directed 4-cycles, respectively, if and only if v(v-1) - vertical bar E(P)vertical bar = 0 (mod 4) and v(v-1) + vertical bar E(P)vertical bar = 0 (mod 4) where vertical bar E(P)vertical bar denotes the number of directed edges of P, and v >= 8.en_US
dc.language.isoen_USen_US
dc.subjectdirected 4-cyclesen_US
dc.subjectcomplete digraphen_US
dc.subjectpackingen_US
dc.subjectcoveringen_US
dc.title(C)over-right-arrow(4)-decompositions of D-v\P and D-v boolean OR P where P is a 2-regular subgraph of D-ven_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s00373-006-0683-yen_US
dc.identifier.journalGRAPHS AND COMBINATORICSen_US
dc.citation.volume22en_US
dc.citation.spage515en_US
dc.citation.epage525en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000243323700009en_US
dc.citation.woscount1en_US
Appears in Collections:Articles