AbstractLet G be a 2-edge-connected graph of order n. For a matching M3 consisting of three independent edges of E(G), let Σ(M3) denote the sum of the degrees of the six vertices incident with M3. We show that if Σ(M3)⩾2n+2 for all 3-matching M3 of G, then either G has a spanning eulerian subgraph, or there is a connected subgraph H of G such that the contraction G/H is K2,t for some odd t. We describe the nature of this contraction. The inequality is best-possible. We obtain several previous results as special cases
A graph G is supereulerian if G has a spanning eulerian subgraph. Boesch et al. [J. Graph Theory, 1,...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
AbstractA graph is supereulerian if it has a spanning eulerian subgraph. It has been an open problem...
AbstractLet G be a 2-edge-connected graph of order n. For a matching M3 consisting of three independ...
This thesis is concerned about the construction of a spanning eulerian supergraph, given a subeuleri...
AbstractGiven a graphG, let ak-trestle ofGbe a 2-connected spanning subgraph ofGof maximum degree at...
AbstractA graph is k-supereulerian if it has a spanning even subgraph with at most k components. We ...
AbstractA graph G is called supereulerian if G has a spanning Eulerian subgraph. Let α′(G) be the ma...
In this note, we verify two conjectures of Catlin in [J. Graph Theory 13 (1989) 465 - 483] for graph...
Using a contraction method, we find some best-possible sufficient conditions for 3-edge-connected s...
This dissertation is primarily focused on conditions for the existence of spanning closed trails in ...
A graph G is collapsible if for every even subset R ⊆ V (G), there is a spanning connected subgraph ...
AbstractIn this paper, we show that the connectivity of the SEE-graph for the connected spanning k-e...
AbstractIn this paper it is proved that for any fixed r and k the number T(G; n, k) of spanning tree...
AbstractConsider a graph G which is a union of m spanning subgraphs regular of degree k. We show tha...
A graph G is supereulerian if G has a spanning eulerian subgraph. Boesch et al. [J. Graph Theory, 1,...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
AbstractA graph is supereulerian if it has a spanning eulerian subgraph. It has been an open problem...
AbstractLet G be a 2-edge-connected graph of order n. For a matching M3 consisting of three independ...
This thesis is concerned about the construction of a spanning eulerian supergraph, given a subeuleri...
AbstractGiven a graphG, let ak-trestle ofGbe a 2-connected spanning subgraph ofGof maximum degree at...
AbstractA graph is k-supereulerian if it has a spanning even subgraph with at most k components. We ...
AbstractA graph G is called supereulerian if G has a spanning Eulerian subgraph. Let α′(G) be the ma...
In this note, we verify two conjectures of Catlin in [J. Graph Theory 13 (1989) 465 - 483] for graph...
Using a contraction method, we find some best-possible sufficient conditions for 3-edge-connected s...
This dissertation is primarily focused on conditions for the existence of spanning closed trails in ...
A graph G is collapsible if for every even subset R ⊆ V (G), there is a spanning connected subgraph ...
AbstractIn this paper, we show that the connectivity of the SEE-graph for the connected spanning k-e...
AbstractIn this paper it is proved that for any fixed r and k the number T(G; n, k) of spanning tree...
AbstractConsider a graph G which is a union of m spanning subgraphs regular of degree k. We show tha...
A graph G is supereulerian if G has a spanning eulerian subgraph. Boesch et al. [J. Graph Theory, 1,...
AbstractWe show that if G is an Eulerian graph of minimum degree 2k, then G has a set S of k−2 Euler...
AbstractA graph is supereulerian if it has a spanning eulerian subgraph. It has been an open problem...