Maximum packings and minimum coverings of K_v with octagons
From MaRDI portal
Publication:968211
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 DK_v
- Maximum packings of inside perfect \(8\)-cycle systems
- scientific article; zbMATH DE number 1792613
Cites work
- Cycle decompositions of K_n and K_n-I
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Enumeration of unlabelled graphs with specified degree parities
- scientific article; zbMATH DE number 1076151 (Why is no real title available?)
- scientific article; zbMATH DE number 238427 (Why is no real title available?)
- Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
- Packing and Covering of the Complete Graph with 4-Cycles*
Cited in
(9)- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
- Maximum packings of complete graphs with octagons.
- Nonisomorphic maximum packing and minimum covering of K_v with 8-cycles
- Outside perfect 8-cycle systems
- Packings and Coverings of the Complete Bipartite Graph by Octagons
- Maximum packings of inside perfect \(8\)-cycle systems
- A note to maximum packings of K_v with a graph G of five vertices and five edges
- Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)
- Kite-group divisible packings and coverings with any minimum leave and minimum excess
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)