A reduction method to find spanning Eulerian subgraphs

We ask, When does a graph G have a subgraph Γ such that the vertices of odd degree in Γ form a specified set S ⊆ V(G), such that G - E(Γ) is connected? If such a subgraph can be found for a suitable choice of S, then this can be applied to problems such as finding a spanning eulerian subgraph of G. We provide a general method, with applications.

[1]  Lane H. Clark.  On hamiltonian line graphs , 1984, J. Graph Theory.

[2]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[3]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[4]  David P. Sumner,et al.  Every connected, locally connected nontrivial graph with no induced claw is hamiltonian , 1979, J. Graph Theory.

[5]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[6]  François Jaeger.  A Note on Sub-Eulerian Graphs , 1979, J. Graph Theory.

[7]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

[8]  Charles L. Suffel,et al.  The spanning subgraphs of eulerian graphs , 1977, J. Graph Theory.

[9]  Paul A. Catlin.  Spanning eulerian subgraphs and matchings , 1989, Discret. Math..

[10]  J. E. Williamson,et al.  On Spanning and Dominating Circuits in Graphs , 1977, Canadian Mathematical Bulletin.

[11]  Hank Jan Veldman,et al.  Existence of spanning and dominating trails and circuits , 1986, J. Graph Theory.

[12]  Richard A. Brualdi,et al.  Hamiltonian line graphs , 1981, J. Graph Theory.

[13]  Henk Jan Veldman,et al.  On circuits and pancyclic line graphs , 1986, J. Graph Theory.

[14]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[15]  F. Harary,et al.  On Eulerian and Hamiltonian Graphs and Line Graphs , 1965, Canadian Mathematical Bulletin.

[16]  Gary Chartrand.  ON HAMILTONIAN LINE-GRAPHS(') , 1968 .

[17]  Sukhamay Kundu,et al.  Bounds on the number of disjoint spanning trees , 1974 .