Maximum packings of complete graphs with octagons.

MaRDI QIDQ3115036zbMATH OpenFDO

Authors Jenq-Jong Lin

Publication date 20 February 2012

zbMATH Keywords

complete graphgraph packingoctagon

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Maximum packings and minimum coverings of \(K_{v}\) with octagons
• Nonisomorphic maximum packing and minimum covering of K_v with 8-cycles
• Maximum packings with odd cycles
• scientific article; zbMATH DE number 2192081
• scientific article; zbMATH DE number 1355295

Cited in

(5)

• Squashing maximum packings of K_n with 8-cycles into maximum packings of K_n with 4-cycles
• Nonisomorphic maximum packing and minimum covering of K_v with 8-cycles
• scientific article; zbMATH DE number 1735724 (Why is no real title available?)
• Packings and Coverings of the Complete Bipartite Graph by Octagons
• Maximum packings and minimum coverings of \(K_{v}\) with octagons

This page was built for publication: Maximum packings of complete graphs with octagons.

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