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

DOI10.1007/S00373-012-1167-XzbMATH Open1268.05159OpenAlexW1974312442MaRDI QIDQ354432FDOQ354432

Authors: Mingchao Li, Jingjing Huo, Qingde 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

Recommendations

• Maximum packings and minimum coverings of \(K_{v}\) with octagons
• Maximum packings of complete graphs with octagons.
• Maximum packings of inside perfect \(8\)-cycle systems
• Outside perfect 8-cycle systems
• scientific article

zbMATH Keywords

\(C_n\)-min\(CD(v)\)excessleavemaximum 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)

Cites Work

• Title not available (Why is that?)
• 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^*
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximum packings and minimum coverings of \(K_{v}\) with octagons

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximum packings and minimum coverings of \(K_{v}\) with octagons
• Almost 2-perfect 8-cycle systems

This page was built for publication: Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354432)