Almost resolvable maximum packings of complete graphs with 4-cycles

DOI10.1007/s00373-010-0967-0zbMath1233.05154OpenAlexW2142036861MaRDI QIDQ659680

D. G. Hoffman, Elizabeth J. Billington, Italo Jose Dejter, Charles C. Lindner

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0967-0

zbMATH Keywords

4-Cycle systemAlmost resolvable maximum packingResolvable cycle system maximum packing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Almost resolvable maximum packings of complete graphs with 5-cycles

Cites Work

• A new class of group divisible designs with block size three
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Unnamed Item
• Unnamed Item
• Unnamed Item

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