Triangle-free Eulerian tours in graphs with maximum degree at most 4

DOI10.1016/0012-365X(94)00183-JzbMath0877.05031OpenAlexW2071148238MaRDI QIDQ1842139

Tobias Adelgren

Publication date: 24 September 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00183-j

zbMATH Keywords

maximum degreeEulerian simple graphstriangle-free Eulerian tour

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Locally self-avoiding Eulerian tours ⋮ Unnamed Item

Cites Work

• Unnamed Item

This page was built for publication: Triangle-free Eulerian tours in graphs with maximum degree at most 4