View in ORKG
DOIAbstract
AbstractAny 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph
AbstractAny 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph
AbstractA graph is called super-Eulerian if it has a spanning closed trail. Let G be a graph with n≥...
AbstractA graph G is called supereulerian if G has a spanning Eulerian subgraph. Let α′(G) be the ma...
A graph is supereulerian if it contains a spanning closed trail. A graph G is collapsible if for eve...
A graph G is supereulerian if G has a spanning eulerian subgraph. Boesch et al. [J. Graph Theory, 1,...
Using a contraction method, we find some best-possible sufficient conditions for 3-edge-connected s...
In this note, we verify two conjectures of Catlin in [J. Graph Theory 13 (1989) 465 - 483] for graph...
This dissertation is primarily focused on conditions for the existence of spanning closed trails in ...
AbstractAny 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed ...
AbstractLet k≥1,l>0,m≥0 be integers, and let Ck(l,m) denote the graph family such that a graph G of ...
AbstractJaeger (1979) proved that if a graph has two edge-disjoint spanning trees, then it is supere...
A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph...
AbstractA graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connect...
A graph is called supereulerian if it has a spanning closed trail. Let $G$ be a 2-edge-connected gra...
AbstractA graph is k-supereulerian if it has a spanning even subgraph with at most k components. We ...
AbstractGiven two nonnegative integers s and t, a graph G is (s,t)-supereulerian if for any disjoint...
AbstractA graph is called super-Eulerian if it has a spanning closed trail. Let G be a graph with n≥...
AbstractA graph G is called supereulerian if G has a spanning Eulerian subgraph. Let α′(G) be the ma...
A graph is supereulerian if it contains a spanning closed trail. A graph G is collapsible if for eve...
A graph G is supereulerian if G has a spanning eulerian subgraph. Boesch et al. [J. Graph Theory, 1,...
Using a contraction method, we find some best-possible sufficient conditions for 3-edge-connected s...
In this note, we verify two conjectures of Catlin in [J. Graph Theory 13 (1989) 465 - 483] for graph...
This dissertation is primarily focused on conditions for the existence of spanning closed trails in ...
AbstractAny 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed ...
AbstractLet k≥1,l>0,m≥0 be integers, and let Ck(l,m) denote the graph family such that a graph G of ...
AbstractJaeger (1979) proved that if a graph has two edge-disjoint spanning trees, then it is supere...
A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph...
AbstractA graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connect...
A graph is called supereulerian if it has a spanning closed trail. Let $G$ be a 2-edge-connected gra...
AbstractA graph is k-supereulerian if it has a spanning even subgraph with at most k components. We ...
AbstractGiven two nonnegative integers s and t, a graph G is (s,t)-supereulerian if for any disjoint...
AbstractA graph is called super-Eulerian if it has a spanning closed trail. Let G be a graph with n≥...
AbstractA graph G is called supereulerian if G has a spanning Eulerian subgraph. Let α′(G) be the ma...
A graph is supereulerian if it contains a spanning closed trail. A graph G is collapsible if for eve...