Art

J-GLOBAL ID：201602257271592782   Reference number：16A1100604

Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths

明確に均等な長さの閉路への完全な2部グラフの分解

Author (3)： Fu Chin-Mei (Tamkang University) ,  Huang Kuo-Ching (Providence University) ,  Mishima Miwako (Gifu University)
Material： Graphs and Combinatorics  (Graphs Comb)
Volume： 32  Issue： 4  Page： 1397-1413  Publication year： 2016 
JST Material Number： X0108A  ISSN： 0911-0119  CODEN： GRCOE5  Document type： Article
Article type： 原著論文  Country of issue： Germany, Federal Republic of (DEU)  Language： ENGLISH (EN)

Thesaurus term： *closed circuit ,  *subgraph ,  completeness ,  *decomposition ,  length ,  even number ,  odd number
Semi thesaurus term： *bipartite graphs

Author keywords (2)： Complete bipartite graph ,  Cycle decomposition

JST classification (1)： Theory of sets  (AB10000I)

Reference (12)：

• Alspach, B.: Research problems. Discrete Math. 36, 333-334 (1981)
• Archdeacon, D., Debowsky, M., Dinitz, J., Gavlas, H.: Cycle systems in the complete bipartite graph minus a one-factor. Discrete Math. 284, 37-43 (2004)
• Bryant, D.: Cycle decompositions of complete graphs. In: Hilton, A., Talbot. J.: (eds.) Surveys in Combinatorics 2007, London Mathematical Society Lecture Note Series, vol. 346, Proceedings of the 21st British Combinatorial Conference, Cambridge University Press, pp. 67-97 (2007)
• Bryant, D., Adams, P.: Decomposing the complete graph into cycles of many lengths. Graphs Combin. 11, 97-102 (1995)
• Bryant, D., Horsley, D., Pettersson, W.: Cycle decompositions V: complete graphs into cycles of arbitrary lengths. Proc. Lond. Math. Soc. 108, 1153-1192 (2014)

Terms in the title (3)： 閉路 ,  2部グラフ ,  分解