A solution to the forest leave problem for partial 6-cycle systems

DOI10.1016/j.disc.2003.08.004zbMath1042.05077OpenAlexW2085012339MaRDI QIDQ1827694

C. A. Rodger, D. J. Ashe, Hung-Lin Fu

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.08.004

zbMATH Keywords

Forest6-cycleCycle systemsLeave

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

All graphs with maximum degree three whose complements have 4-cycle decompositions ⋮ Six-cycle systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quadratic leaves of maximal partial triple systems
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions III: Complete graphs and fixed length cycles
• On the construction of odd cycle systems
• Forest leaves and four-cycles
• Four-cycle systems with two-regular leaves

This page was built for publication: A solution to the forest leave problem for partial 6-cycle systems