Almost resolvable maximum packings of complete graphs with 5-cycles

DOI10.1007/S11464-015-0425-7zbMATH Open1326.05126OpenAlexW2041904984MaRDI QIDQ893340FDOQ893340

H. Cao, Min Zhou

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

Recommendations

• Maximum (minimum) almost resolvable \((4,2)\)-cycle packing (covering) of a complete graph
• Almost resolvable maximum packings of complete graphs with 4-cycles
• Maximum packings with odd cycles
• Packing complete multipartite graphs with 4-cycles
• On the existence of maximum resolvable (\(K_{4} - e\))-packings

zbMATH Keywords

cycle packingcycle frameresolvable maximum cycle packing

Mathematics Subject Classification ID

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

Cites Work

• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• The solution of the bipartite analogue of the Oberwolfach problem
• The equipartite Oberwolfach problem with uniform tables
• Packing cycles in complete graphs
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The Oberwolfach problem and factors of uniform odd length cycles
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Title not available (Why is that?)
• Hanani triple systems
• A new class of group divisible designs with block size three
• Title not available (Why is that?)
• Title not available (Why is that?)
• Frames for Kirkman triple systems
• Two new direct product‐type constructions for resolvable group‐divisible designs
• Title not available (Why is that?)
• On the existence of cycle frames and almost resolvable cycle systems
• Resolvable group divisible designs with block size 3
• Title not available (Why is that?)
• Almost resolvable cycle systems-an analogue of Hanani triple systems
• The generalized almost resolvable cycle system problem
• More results on cycle frames and almost resolvable cycle systems
• Title not available (Why is that?)
• Almost resolvable maximum packings of complete graphs with 4-cycles
• Maximum packings with odd cycles
• Title not available (Why is that?)
• Packing pentagons into complete graphs: How clumsy can you get?
• On the Oberwolfach problem OP\((5^a, s)\)
• Maximum packings of the complete graph with uniform length cycles

Cited In (2)

• Maximizing five-cycles in \(K_r\)-free graphs
• Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)

This page was built for publication: Almost resolvable maximum packings of complete graphs with 5-cycles

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