Maximum packings of the complete graph with uniform length cycles
From MaRDI portal
Publication:3174232
DOI10.1002/JGT.20536zbMATH Open1234.05188OpenAlexW2077942532MaRDI QIDQ3174232FDOQ3174232
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
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Cycle decompositions of complete multigraphs
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Packing cycles in complete graphs
- Packing and Covering of the Complete Graph with 4-Cycles*
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum packings with odd cycles
- An asymptotic solution to the cycle decomposition problem for complete graphs
- Decompositions of complete graphs into long cycles
- On the Alspach conjecture
- 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
- Weakly union-free maximum packings
- Graphs with unique maximum packing of closed neighborhoods
- Almost resolvable maximum packings of complete graphs with 5-cycles
- Cycle packings of the complete multigraph
- Six-cycle systems
- On maximum cycle packings in polyhedral graphs
- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
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)
