Maximum packings and minimum coverings of \(K_{v}\) with octagons

DOI10.1007/S00373-010-0879-ZzbMath1205.05182OpenAlexW2171608184MaRDI QIDQ968211

Mingchao Li, Jingjing Huo, Zhichao Gao

Publication date: 5 May 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0879-z

zbMATH Keywords

leaverepeat\(G\)-packing\(G\)-coveringnonisomorphic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Almost 2-perfect 8-cycle systems ⋮ Packings and Coverings of the Complete Bipartite Graph by Octagons ⋮ Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Enumeration of unlabelled graphs with specified degree parities
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
• Packing and Covering of the Complete Graph with 4-Cycles^*

This page was built for publication: Maximum packings and minimum coverings of \(K_{v}\) with octagons