A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph

Zbigniew Lonc, Pawel Naroski. A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph. Discrete Mathematics & Theoretical Computer Science, 14(1):147-158, 2012. [doi]

Abstract

Abstract is missing.