Minimum coverings of the complete graph with 5-cycles

zbMATH Open1114.05083MaRDI QIDQ3423967FDOQ3423967

Authors: Salvatore Milici 

Publication date: 15 February 2007

Recommendations

• Coverings of a complete graph with five-vertex and five-edge graphs
• scientific article; zbMATH DE number 1076151
• Pentagons and cycle coverings
• 4-cycle coverings of the complete graph with a hole
• Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs

zbMATH Keywords

partition

Mathematics Subject Classification ID

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

Cited In (6)

• Dihedral covers of the complete graph \(K_5\)
• 4-cycle coverings of the complete graph with a hole
• Coverings of a complete graph with five-vertex and five-edge graphs
• Maximizing five-cycles in \(K_r\)-free graphs
• Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
• Restricted and unrestricted hexagon coverings of the complete bipartite graph

This page was built for publication: Minimum coverings of the complete graph with 5-cycles

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