Hamilton circuits in the directed wrapped Butterfly network
DOI10.1016/S0166-218X(97)00095-4zbMath0901.05062OpenAlexW2036367133MaRDI QIDQ1392560
E. Darrot, Jean-Claude Bermond, Stéphane Pérennes, Olivier Delmas
Publication date: 18 October 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Applications of graph theory (05C90) Communication networks in operations research (90B18) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian decomposition of Cayley graphs of degree 4
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
- Two edge-disjoint hamiltonian cycles in the butterfly graph
- Hamilton circuits in the directed wrapped Butterfly network
- Compatible Eulerian circuits in \(K_ n^{**}\)
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
This page was built for publication: Hamilton circuits in the directed wrapped Butterfly network