Maximum packings of the complete graph with uniform length cycles

DOI10.1002/JGT.20536MaRDI QIDQ3174232zbMATH OpenOpenAlexFDO

Authors Daniel Horsley

Publication date 12 October 2011

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20536

zbMATH Keywords

cyclesmaximum packings

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1076151 (Why is no real title available?)
• scientific article; zbMATH DE number 3235247 (Why is no real title available?)
• An asymptotic solution to the cycle decomposition problem for complete graphs
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions of complete multigraphs
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• Decompositions of complete graphs into long cycles
• Maximum packings with odd cycles
• On the Alspach conjecture
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Packing cycles in complete graphs
• Packing pentagons into complete graphs: How clumsy can you get?
• The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs.

Cited in

(8)

• Decomposing various graphs into short even-length cycles
• Cycle packings of the complete multigraph
• Graphs with unique maximum packing of closed neighborhoods
• Weakly union-free maximum packings
• Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
• Almost resolvable maximum packings of complete graphs with 5-cycles
• On maximum cycle packings in polyhedral graphs
• Six-cycle systems

This page was built for publication: Maximum packings of the complete graph with uniform length cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174232)