Two edge-disjoint hamiltonian cycles in the butterfly graph

DOI10.1016/0020-0190(94)00087-5zbMath0807.05047OpenAlexW1966151552MaRDI QIDQ1334638

Andre Raspaud, Dominique Barith

Publication date: 25 September 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00087-5

zbMATH Keywords

hamiltonian cyclesbutterfly graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Disjoint Hamiltonian cycles in recursive circulant graphs ⋮ Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs ⋮ More agents may decrease global work: a case in butterfly decontamination ⋮ Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey ⋮ Cycles in butterfly graphs ⋮ Hamilton circuits in the directed wrapped Butterfly network ⋮ Embedding three edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Well-solved cases of the 2-peripatetic salesman problem ⋮ Minimum spanners of butterfly graphs ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Some problems on Cayley graphs ⋮ The forwarding indices of wrapped butterfly networks ⋮ A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian decomposition of Cayley graphs of degree 4
• On Hamiltonian cycles in Cayley graphs of wreath products
• Methods and problems of communication in usual networks
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Group Action Graphs and Parallel Architectures

This page was built for publication: Two edge-disjoint hamiltonian cycles in the butterfly graph