Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord.

DOI10.1016/S0012-365X(03)00276-0zbMath1035.05069OpenAlexW2059961884MaRDI QIDQ1428531

Yanfang Zhang, Hui-Juan Zuo, Qing-de Kang

Publication date: 29 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00276-0

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)

Related Items

Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges ⋮ Graph designs for all graphs with six vertices and eight edges

Cites Work

• A note on packing trees into complete bipartite graphs and on Fishburn's conjecture
• Packing and covering of the complete graph with a graph G of four vertices or less
• The packing and covering of the complete graph. I: The forests of order five
• Covering graphs: The covering problem solved
• Maximum packings of \(K_ n\) with copies of \(K_ 4-e\)
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packings of \(K_v\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item