Hamilton circuits in the directed wrapped Butterfly network
type: Item
instance of: scholarly article
title: Hamilton circuits in the directed wrapped Butterfly network
zbMATH Open document ID: 0901.05062
DOI: 10.1016/S0166-218X(97)00095-4
author: E. Darrot
author: Jean-Claude Bermond
author: Olivier Delmas
author: Stéphane Pérennes
published in: Discrete Applied Mathematics
publication date: 1998-10-18T00:00:00Z
full work available at URL: dam
review text: The authors prove that the wrapped Butterfly digraph of outdegree \(d\) and dimension \(n\) contains at least \(d-1\) arc-disjoint Hamilton directed cycles. They conjecture there is a Hamilton decomposition in all cases other than \(d=n=2\); \(d=2\) and \(n=3\); and \(d=3\) and \(n=2\). They offer strong evidence in support of the conjecture. Helen Verrall recently has completed the proof of the conjecture (Discrete Appl. Math., to appear).
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 1180351
zbMATH Keywords: Hamilton decomposition
zbMATH Keywords: Hamilton directed cycle
zbMATH Keywords: wrapped Butterfly digraph
reviewed by: Brian Alspach
MaRDI profile type: Publication
cites work: Q3197858
cites work: Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
cites work: Compatible Eulerian circuits in \(K_ n^{**}\)
cites work: Two edge-disjoint hamiltonian cycles in the butterfly graph
cites work: Hamiltonian decomposition of Cayley graphs of degree 4
cites work: Q3827949
cites work: Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
cites work: Q3972098
cites work: Q4002466
cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
OpenAlex ID: W2036367133
description: scientific article; zbMATH DE number 1180351