On tours that contain all edges of a hypergraph

zbMath1204.05064MaRDI QIDQ612925

Paweł Naroski, Zbigniew Lonc

Publication date: 16 December 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/230726

zbMATH Keywords

uniform hypergraphsEuler toursEuler walks

Mathematics Subject Classification ID

Hypergraphs (05C65) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts ⋮ Quasi-Eulerian hypergraphs ⋮ Euler tours in hypergraphs ⋮ Triple Systems are Eulerian ⋮ Covering hypergraphs are Eulerian ⋮ Using edge cuts to find Euler tours and Euler families in hypergraphs ⋮ Unnamed Item ⋮ Circuit decompositions and shortest circuit coverings of hypergraphs

This page was built for publication: On tours that contain all edges of a hypergraph