4-cycle systems of \(K_n-E(F^\ast)\)

DOI10.1007/S00373-014-1433-1zbMath1322.05080OpenAlexW202516987MaRDI QIDQ497370

C. A. Rodger, Nidhi Sehgal

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1433-1

zbMATH Keywords

cycle systemsnearly 2-regularspecified leave

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Near 2-factorizations of \(2K_ n:\) Cycles of even length
• All graphs with maximum degree three whose complements have 4-cycle decompositions
• Quadratic leaves of maximal partial triple systems
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Cycle decompositions of the line graph of \(K_ n\)
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Decompositions of complete multipartite graphs into cycles of even length
• Hamilton cycle rich 2-factorizations of complete multipartite graphs
• Cycle decompositions III: Complete graphs and fixed length cycles
• Decomposing complete equipartite graphs into short even cycles
• On the construction of odd cycle systems
• Hamilton cycle rich two-factorizations of complete graphs
• Cycle systems of the line graph of the complete graph
• Four-cycle systems with two-regular leaves

This page was built for publication: 4-cycle systems of \(K_n-E(F^\ast)\)