Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles

DOI10.1007/S00373-012-1167-XzbMath1268.05159OpenAlexW1974312442MaRDI QIDQ354432

Mingchao Li, Jingjing Huo, Qing-de Kang

Publication date: 19 July 2013

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

Full work available at URL: https://doi.org/10.1007/s00373-012-1167-x

zbMATH Keywords

excess\(C_n\)-min\(CD(v)\)leavemaximum packingminimum coveringnonisomorphic \((v, \frac{v}{2}+s)\)-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 (2)

Almost 2-perfect 8-cycle systems ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum packings and minimum coverings of \(K_{v}\) with octagons
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• 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: Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles