Pairwise compatible Hamilton decompositions of \(K_n\)

DOI10.1006/JCTA.1997.2777zbMath0901.05075OpenAlexW2085858763MaRDI QIDQ1364230

Helen Verrall

Publication date: 9 November 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1997.2777

zbMATH Keywords

graph decompositionsHamilton decompositionscompatible decompositions

Mathematics Subject Classification ID

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

Related Items (3)

Double coverings of 2‐paths by Hamilton cycles* ⋮ Covering 2-paths uniformly ⋮ Compatible Hamilton decompositions of directed wrapped butterfly graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dudeney's round table problem
• Exact coverings of 2-paths by Hamilton cycles
• A solution of Dudeney's round table problem for an even number of people
• Finite topologies and Hamiltonian paths
• A Construction of a perfect set of Euler tours of K2k+1

This page was built for publication: Pairwise compatible Hamilton decompositions of \(K_n\)