Compatible Hamilton decompositions of directed wrapped butterfly graphs

DOI10.1016/S0166-218X(98)00130-9zbMath0918.05073MaRDI QIDQ1283804

Helen Verrall

Publication date: 10 August 1999

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

zbMATH Keywords

directed graphHamiltonian cycleHamilton decompositionDudeney setcompatible decompositionswrapped butterfly graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Dudeney's round table problem
• A solution of Dudeney's round table problem for an even number of people
• Pairwise compatible Hamilton decompositions of \(K_n\)
• Hamilton circuits in the directed wrapped Butterfly network
• Unnamed Item

This page was built for publication: Compatible Hamilton decompositions of directed wrapped butterfly graphs