Eulerian and Hamiltonian dicycles in directed hypergraphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics, Algorithms and Applications Année : 2014

Eulerian and Hamiltonian dicycles in directed hypergraphs

Résumé

In this article, we generalize the concepts of Eulerian and Hamiltonian digraphs to directed hypergraphs. A dihypergraph H is a pair (V(H), E(H)), where V(H) is a non-empty set of elements, called vertices, and E(H) is a collection of ordered pairs of subsets of V(H), called hyperarcs. It is Eulerian (resp. Hamiltonian) if there is a dicycle containing each hyperarc (resp. each vertex) exactly once. We first present some properties of Eulerian and Hamiltonian dihypergraphs. For example, we show that deciding whether a dihypergraph is Eulerian is an NP-complete problem. We also study when iterated line dihypergraphs are Eulerian and Hamiltonian. Finally, we study when the generalized de Bruijn dihypergraphs are Eulerian and Hamiltonian. In particular, we determine when they contain a complete Berge dicycle, i.e. an Eulerian and Hamiltonian dicycle.
Fichier principal
Vignette du fichier
dihypergraphs-article.pdf (504.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01104634 , version 1 (18-01-2015)
hal-01104634 , version 2 (06-02-2015)

Identifiants

Citer

Julio Araujo, Jean-Claude Bermond, Guillaume Ducoffe. Eulerian and Hamiltonian dicycles in directed hypergraphs. Discrete Mathematics, Algorithms and Applications, 2014, 06, pp.1450012. ⟨10.1142/S1793830914500128⟩. ⟨hal-01104634v2⟩
416 Consultations
456 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More