Premium
Supereulerian graphs: A survey
Author(s) -
Catlin Paul A.
Publication year - 1992
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190160209
Subject(s) - combinatorics , mathematics , line graph , block graph , pancyclic graph , distance hereditary graph , eulerian path , discrete mathematics , hamiltonian path , indifference graph , graph , pathwidth , voltage graph , pure mathematics , lagrangian
A graph is supereulerian if it has a spanning eulerian subgraph. There is a rduction method to determine whether a graph is supereulerian, 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 supereulerian graphs, the reduction method, and its applications.