@article{dmtcs:568,
    title      = {A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph},
    author     = {Zbigniew Lonc and Pawel Naroski},
    url        = {https://dmtcs.episciences.org/568},
    doi        = {10.46298/dmtcs.568},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {Vol. 14 no. 1},
    issuetitle = {Discrete Algorithms},
    eid        = 6,
    year       = {2012},
    month      = {Jun},
    keywords   = {3-uniform hypergraph, Euler walk, strongly connected hypergraph, linear time algorithm, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]},
    language   = {English},
}