Packings and coverings of various complete graphs with the 4-cycle with a pendant edge

DOI10.1155/2013/236298zbMath1288.05202OpenAlexW2155690655WikidataQ58994255 ScholiaQ58994255MaRDI QIDQ2449263

Brandon Coker, Yan Xia, Robert B. Gardner, Gary D. Coker

Publication date: 7 May 2014

Published in: ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/236298

zbMATH Keywords

restricted coveringsunrestricted coverings

Mathematics Subject Classification ID

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

Cites Work

• 5-cycle systems with holes
• Minimal coverings of pairs by triples
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Optimal packings of \(K_4\)'s into a \(K_n\)
• Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
• Graph designs for all graphs with six vertices and eight edges
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Packings and coverings of various complete graphs with the 4-cycle with a pendant edge