Compatible Hamilton decompositions of directed wrapped butterfly graphs

DOI10.1016/S0166-218X(98)00130-9zbMATH Open0918.05073MaRDI QIDQ1283804FDOQ1283804

Authors: Helen Verrall 

Publication date: 10 August 1999

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

Recommendations

• Hamilton circuits in the directed wrapped Butterfly network
• Two edge-disjoint hamiltonian cycles in the butterfly graph
• Hamilton cycles and paths in butterfly graphs
• Hamiltonian decomposition of complete regular multipartite digraphs
• Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
• scientific article; zbMATH DE number 1883589
• On Hamiltonian cycles in \(C_nX_{2:2}C_m\)
• scientific article; zbMATH DE number 773235
• Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs
• Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs

zbMATH Keywords

Hamiltonian cycledirected graphHamilton decompositionDudeney setcompatible decompositionswrapped butterfly graph

Mathematics Subject Classification ID

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

Cites Work

• A solution of Dudeney's round table problem for an even number of people
• Title not available (Why is that?)
• Hamilton circuits in the directed wrapped Butterfly network
• Dudeney's round table problem
• Pairwise compatible Hamilton decompositions of \(K_n\)

Cited In (1)

• Title not available (Why is that?)

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

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