Almost resolvable maximum packings of complete graphs with 5-cycles
From MaRDI portal
Publication:893340
DOI10.1007/S11464-015-0425-7zbMath1326.05126OpenAlexW2041904984MaRDI QIDQ893340
Publication date: 19 November 2015
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-015-0425-7
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On the existence of cycle frames and almost resolvable cycle systems
- The generalized almost resolvable cycle system problem
- Almost resolvable maximum packings of complete graphs with 4-cycles
- Hanani triple systems
- More results on cycle frames and almost resolvable cycle systems
- Resolvable group divisible designs with block size 3
- Packing cycles in complete graphs
- Frames for Kirkman triple systems
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- The solution of the bipartite analogue of the Oberwolfach problem
- A new class of group divisible designs with block size three
- Packing pentagons into complete graphs: How clumsy can you get?
- Maximum packings with odd cycles
- The Oberwolfach problem and factors of uniform odd length cycles
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- The equipartite Oberwolfach problem with uniform tables
- Cycle decompositions III: Complete graphs and fixed length cycles
- Maximum packings of the complete graph with uniform length cycles
- Almost resolvable cycle systems-an analogue of Hanani triple systems
- Packing and Covering of the Complete Graph with 4-Cycles*
- Two new direct product‐type constructions for resolvable group‐divisible designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Almost resolvable maximum packings of complete graphs with 5-cycles
