A graph is supereulerian if it has a spanning eulerian subgraph. There is a reduction method to determine whether a graph is su-pereulerian, and it can also be applied to study other concepts, e.g., hamiltonian line graphs, a certain type of double cycle cover, and the total interval number of a graph. We outline the research on supereu-lerian graphs, the… (More)
Any 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph. 1996 Academic Press, Inc.