Packing pentagons into complete graphs: How clumsy can you get?

DOI10.1016/0012-365X(94)90121-XzbMath0797.05063MaRDI QIDQ1322192

Štefan Znám, Alexander Rosa

Publication date: 10 October 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

spectrumeulerian graphantieulerian graphpentagonal packingpentagons

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

Maximum packings with odd cycles ⋮ Maximum packings of the complete graph with uniform length cycles ⋮ Packings and Coverings of the Complete Bipartite Graph by Octagons ⋮ The impact of emigration on Slovak mathematics: the case of the Bratislava graph theory seminar ⋮ Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ Unnamed Item ⋮ Packing cycles in complete graphs ⋮ Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) ⋮ Unnamed Item ⋮ Six-cycle systems

Cites Work

• Large cycles in graphs
• On the construction of odd cycle systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing pentagons into complete graphs: How clumsy can you get?