Decomposing complete tripartite graphs into closed trails of arbitrary lengths |
| |
| Authors: | Elizabeth J. Billington Nicholas J. Cavenagh |
| |
| Affiliation: | (1) Centre for Discrete Mathematics and Computing, Department of Mathematics, The University of Queensland, Brisbane, Qld, 4072, Australia;(2) Institute for Theoretical Computer Science ITI, Charles University, Malostranské náměstí 25, 118 00 Praha 1, Czech Republic |
| |
| Abstract: | The complete tripartite graph K n,n,n has 3n 2 edges. For any collection of positive integers x 1, x 2,...,x m with  and x i ⩾ 3 for 1 ⩽ i ⩽ m, we exhibit an edge-disjoint decomposition of K n,n,n into closed trails (circuits) of lengths x 1, x 2,..., x m. Supported by Ministry of Education of the Czech Republic as project LN00A056. |
| |
| Keywords: | cycles decomposing complete tripartite graphs |
| 本文献已被 SpringerLink 等数据库收录！ |
|
