Learn More
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)