Packing cycles in complete graphs

DOI10.1016/J.JCTB.2007.12.004MaRDI QIDQ947728zbMATH OpenOpenAlexFDO

Authors Daniel Horsley, Darryn Bryant

Publication date 7 October 2008

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2007.12.004

zbMATH Keywords

graph decompositionsgraph packingcycle decompositions

Mathematics Subject Classification ID

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

Recommendations

• Cycle packings of the complete multigraph
• Packings in complete graphs
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Packing closed trails into dense graphs.
• Packing circuits into \(K_N\).

Cites work

• scientific article; zbMATH DE number 3922695 (Why is no real title available?)
• scientific article; zbMATH DE number 124520 (Why is no real title available?)
• scientific article; zbMATH DE number 1076151 (Why is no real title available?)
• scientific article; zbMATH DE number 3235247 (Why is no real title available?)
• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions of complete graphs
• Cycle decompositions of the complete graph.
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• Decompositions of complete graphs into triangles and Hamilton cycles
• Embedding Partial Steiner Triple Systems
• On Alspach's conjecture
• On Alspach's conjecture with two even cycle lengths
• On the Alspach conjecture
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Packing circuits into \(K_N\).
• Packing pentagons into complete graphs: How clumsy can you get?

Cited in

(21)

• Packing closed trails into dense graphs.
• Decomposition of a complete bipartite multigraph into arbitrary cycle sizes
• Induced Packing of Odd Cycles in a Planar Graph
• Maximum packings of the complete graph with uniform length cycles
• Packing paths in complete graphs
• Small cycles and 2-factor passing through any given vertices in graphs
• Cycle packings of the complete multigraph
• Packing cycles through prescribed vertices
• Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
• Packings in complete graphs
• Decompositions of complete multigraphs into cycles of varying lengths
• Almost resolvable maximum packings of complete graphs with 5-cycles
• Cycle decompositions of complete multigraphs
• Small embeddings for partial 5-cycle systems
• Packing cycles in graphs. II
• Face 2-Colorable Embeddings with Faces of Specified Lengths
• Scattered packings of cycles
• On maximum cycle packings in polyhedral graphs
• Packing directed cycles efficiently
• Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges
• An asymptotic solution to the cycle decomposition problem for complete graphs

This page was built for publication: Packing cycles in complete graphs

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