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

Tobias Adelgren
1995 Discrete Mathematics  
In this paper we completely characterise the family of eulerian simple graphs G with maximum degree at most 4 which admit a triangle-free eulerian tour, i.e., a sequence v l v2 .--v" c l such that each vi is a vertex, the pairs vi, vi+ 1, i = 1,2 ..... m are the m distinct edges in G and finally, v~+ 3 ~ v~ for all i = 1,2 ..... m, with indices counted modulo m. 0012-365X/95/$09.50 (C) 1995--Elsevier Science B.V. All rights reserved SSDI 0012-365X(94)00183-9
doi:10.1016/0012-365x(94)00183-j fatcat:yr3pcetvhzfufe5y4v7nfpu4vy