Directed 3-cycle decompositions of complete directed graphs with quadratic leaves

作者：Pu, Liqun^*; Fu, Hung-Lin; Shen, Hao

来源：Discrete Mathematics, 2009, 309(14): 4705-4715.

DOI：10.1016/j.disc.2008.05.039

• Mendelsohn triples
• Complete directed graph
• Packing

Let G be a vertex-disjoint union of directed cycles in the complete directed graph D-t, let vertical bar E(G)vertical bar be the number of directed edges of G and suppose G not equal 54 (C) over right arrow (2) boolean OR (C) over right arrow (3) or (C) over right arrow (5) if t = 5, and G not equal (C) over right arrow (3) boolean OR (C) over right arrow (3) if t = 6. It is proved in this paper that for each positiv

• 出版日期2009-7-28
• 单位上海交通大学; 郑州大学