Maximum packings and minimum coverings of K_v with octagons
From MaRDI portal
Publication:968211
DOI10.1007/S00373-010-0879-ZzbMATH Open1205.05182OpenAlexW2171608184MaRDI QIDQ968211FDOQ968211
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
Recommendations
- Maximum packings of complete graphs with octagons.
- Packings and Coverings of the Complete Bipartite Graph by Octagons
- Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles
- scientific article; zbMATH DE number 238427
- scientific article; zbMATH DE number 3979926
- Squashing maximum packings of \(K_n\) with 8-cycles into maximum packings of \(K_n\) with 4-cycles
- Reinhardt's problem of lattice packings of convex domains: Local extremality of the Reinhardt octagon
- Optimal packings and coverings of \(\lambda\)DK\(_v\)
- Maximum packings of inside perfect \(8\)-cycle systems
- scientific article; zbMATH DE number 1792613
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- 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?)
- Enumeration of unlabelled graphs with specified degree parities
Cited In (8)
- Title not available (Why is that?)
- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
- Kite-group divisible packings and coverings with any minimum leave and minimum excess
- Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles
- A note to maximum packings of \(K_v\) with a graph \(G\) of five vertices and five edges
- Packings and Coverings of the Complete Bipartite Graph by Octagons
- Almost 2-perfect 8-cycle systems
- Title not available (Why is that?)
This page was built for publication: Maximum packings and minimum coverings of \(K_{v}\) with octagons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968211)
