Eulerian iterated line graphs and digraphs

Erich Prisner
2001 Discrete Mathematics  
It is shown that every strongly connected digraph has either at most one or inÿnitely many of its iterated line digraphs eulerian. The proof uses a canonical way of 'wrapping' a digraph D around a directed cycle whose length is the greatest common divisor of all directed-cycle lengths of D. A simple characterization of undirected graphs with some iterated line graph eulerian is also given.
doi:10.1016/s0012-365x(00)00450-7 fatcat:xw4tvihj7rg5vlg77mw5mmxwdi