Packing pentagons into complete graphs: How clumsy can you get?
From MaRDI portal
Publication:1322192
DOI10.1016/0012-365X(94)90121-XzbMath0797.05063MaRDI QIDQ1322192
Publication date: 10 October 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
Unnamed Item, Packings and Coverings of the Complete Bipartite Graph by Octagons, Unnamed Item, Almost resolvable maximum packings of complete graphs with 5-cycles, Packing cycles in complete graphs, Maximum packings with odd cycles, Six-cycle systems, Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\), The impact of emigration on Slovak mathematics: the case of the Bratislava graph theory seminar, Maximum packings of the complete graph with uniform length cycles
Cites Work