Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference11 articles.
1. Balister P.: Packing circuits into K N . Combin. Probab. Comput. 10, 463–499 (2001)
2. Billington E.J., Cavenagh N.J.: Decomposing complete tripartite graphs into closed trails of arbitrary lengths. Czechoslovak Math. J. 57, 523–551 (2007)
3. Billington, E.J., Cavenagh, N.J., Smith, B.R.: Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts. Discrete Math. (to appear)
4. Billington E.J., Lindner C.C.: Maximum packings of bowtie designs. J. Combin. Math. Combin. Comput. 27, 227–249 (1998)
5. Cavenagh N.J.: Decompositions of complete tripartite graphs into k-cycles. Australas. J. Combin. 18, 193–200 (1998)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献