A characterization of graphs with supereulerian line graphs

Abstract

The line graph of a graph G is a simple graph with being its vertex set, where two vertices are adjacent in whenever the corresponding edges share a common vertex in G. A graph H is even if every vertex of H has even degree, and a graph is supereulerian if it has a spanning closed trail. We obtain a characterization for a graph G to have a supereulerian line graph , as follows: for a connected graph G with , the line graph has a spanning closed trail if and only if G has an even subgraph H (possibly null) such that both G remains connected after deleting all degree 2 vertices not in H, and every degree 2 vertex not in H must be adjacent only to vertices of degree at least 3 in G.