EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS

DOI10.1142/S1793830914500128zbMath1286.05110MaRDI QIDQ5411807

Guillaume Ducoffe, Julio Araujo, Jean-Claude Bermond

Publication date: 25 April 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830914500128

zbMATH Keywords

directed hypergraphs; de Bruijn dihypergraphs; Eulerian and Hamiltonian dicycles

Mathematics Subject Classification ID

05C65: Hypergraphs

05C38: Paths and cycles

05C45: Eulerian and Hamiltonian graphs

Related Items

Hamiltonicity of large generalized de Bruijn cycles

Cites Work

• Unnamed Item
• Loose Hamilton cycles in hypergraphs
• The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• The Hamiltonian property of generalized de Bruijn digraphs
• Large generalized cycles
• The Hamiltonian property of consecutive-\(d\) digraphs
• Connectivity and fault-tolerance of hyperdigraphs
• A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
• The Hamiltonian property of the consecutive-3 digraphs
• Super line-connectivity of consecutive-\(d\) digraphs
• The Hamiltonian property of linear functions
• On connectivity of consecutive-\(d\) digraphs
• Bus interconnection networks
• Generalized de Bruijn digraphs
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• De Bruijn and Kautz bus networks
• Partial line directed hypergraphs
• Spectral Theory and Analysis