Supereulerian graphs, independent sets, and degree-sum conditions
A graph is supereulerian if it contains a spanning closed trail. A graph G is collapsible if for every even subset R ⊆ V(G), there is a spanning connected subgraph of G whose set of odd degree vertices is R. The graph K1 is regarded as a trivial collapsible graph. A graph is reduced if it contains no nontrivial collapsible subgraphs. In this paper, we study the independence numbers of reduced graphs. As an application, we also obtain new degree-sum conditions for supereulerian graphs and collapsible graphs.
Chen, Zhi-Hong, "Supereulerian graphs, independent sets, and degree-sum conditions" Discrete Mathematics 179/1-3 (1998): 73-87.
Available at https://digitalcommons.butler.edu/facsch_papers/1195
Note: full-text not available due to publisher restrictions. Link takes you to an external site where you can purchase the article or borrow it from a local library.