Tight Euler tours in uniform hypergraphs -- computational aspects

MaRDI QIDQ4560203zbMATH OpenFDO

Authors Zbigniew Lonc, Paweł Naroski, Paweł Rzążewski

Publication date 10 December 2018

Full work available at URL https://arxiv.org/abs/1706.09356, https://dmtcs.episciences.org/3934/pdf

zbMATH Keywords

Eulerian hypergraphstight Euler tour

Mathematics Subject Classification ID

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

Recommendations

• On tours that contain all edges of a hypergraph
• Euler tours in hypergraphs
• Quasi-Eulerian hypergraphs
• scientific article; zbMATH DE number 6829379
• Covering hypergraphs are Eulerian

Cited in

(3)

• Euler tours in hypergraphs
• Multi-Eulerian tours of directed graphs
• On tours that contain all edges of a hypergraph

This page was built for publication: Tight Euler tours in uniform hypergraphs -- computational aspects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560203)