A reduction method to find spanning Eulerian subgraphs
From MaRDI portal
Recommendations
Cites work
- Contractions of graphs with no spanning Eulerian subgraphs
- Graph theory with applications
- scientific article; zbMATH DE number 4043881 (Why is no real title available?)
- scientific article; zbMATH DE number 4081604 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On Spanning and Dominating Circuits in Graphs
Cited in
(only showing first 100 items - show all)- Parity and disparity subgraphs
- Collapsible graphs and reductions of line graphs
- Hamiltonian connectedness in 3-connected line graphs
- Traceability of line graphs
- The supereulerian graphs in the graph family \(C(l,k)\)
- Hamilton-connected indices of graphs
- On the Hamiltonian index
- Contractions of graphs with no spanning Eulerian subgraphs
- Spanning Eulerian subgraphs and matchings
- The reduction of graph families closed under contraction
- Graphs without spanning closed trails
- Graph whose edges are in small cycles
- Duality in graph families
- On dominating and spanning circuits in graphs
- A simple upper bound for the hamiltonian index of a graph
- The size of graphs with clique number \(m\) and without nowhere-zero 4-flows
- Supereulerian graphs, independent sets, and degree-sum conditions
- Eulerian subgraphs containing given vertices and hamiltonian line graphs
- A note on minimum degree conditions for supereulerian graphs
- The parity Hamiltonian cycle problem
- Locally dense supereulerian digraphs
- Degree sum and Hamiltonian-connected line graphs
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Collapsible subgraphs of a 4-edge-connected graph
- Forbidden subgraphs and weak locally connected graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Pancyclicity of hamiltonian line graphs
- The Hamiltonian index of a graph and its branch-bonds
- Supereulerian graphs and excluded induced minors
- Hitting time for \(k\) edge-disjoint spanning trees in a random graph
- Group connectivity in 3-edge-connected graphs
- Spanning Eulerian subgraphs of 2-edge-connected graphs
- The Chvátal-Erdős condition for group connectivity in graphs
- Induced nets and Hamiltonicity of claw-free graphs
- Supereulerian line graphs
- On the extended Clark-Wormold Hamiltonian-like index problem
- Complete family reduction and spanning connectivity in line graphs
- A condition on Hamilton-connected line graphs
- Forbidden subgraphs for collapsible graphs and supereulerian graphs
- Hamiltonian line graphs with local degree conditions
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II
- On the s-hamiltonianicity of an hourglass-free line graph
- Strengthened Ore conditions for (s, t)-supereulerian graphs
- Forbidden subgraphs on Hamiltonian index
- A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices
- On sufficient degree conditions for traceability of claw-free graphs
- Eulerian subgraphs and \(S\)-connectivity of graphs
- Forbidden subgraphs for supereulerian and Hamiltonian graphs
- Chvátal-Erdős conditions and almost spanning trails
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
- On s-Hamiltonicity of net-free line graphs
- On the line graph of a graph with diameter 2
- On \(( s , t )\)-supereulerian graphs with linear degree bounds
- Polynomially determine if a graph is \((s,3)\)-supereulerian
- Lai's conditions for spanning and dominating closed trails
- 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
- On \(s\)-Hamiltonian line graphs of claw-free graphs
- Spanning trails in a 2-connected graph
- Spanning trees and spanning Eulerian subgraphs with small degrees
- Group connectivity and matchings
- Circumferences of 3-connected claw-free graphs. II.
- Even factors with a bounded number of components in iterated line graphs
- Spanning trails with variations of Chvátal-Erdős conditions
- Supereulerian width of dense graphs
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- Traceability on 2-connected line graphs
- Spanning 3-connected index of graphs
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors
- Hamiltonicity in 3-connected claw-free graphs
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- Collapsible biclaw-free graphs
- 2-factors with bounded number of components in claw-free graphs
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
- On spanning disjoint paths in line graphs
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Supereulerian graphs with constraints on the matching number and minimum degree
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
- Circumferences of 3-connected claw-free graphs
- Properties of Catlin's reduced graphs and supereulerian graphs
- On s-Hamiltonian line graphs
- Reducibility of Eulerian graphs and digraphs
- Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Maximal K₃'s and hamiltonicity of 4-connected claw-free graphs
- Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
- Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
- Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Reduced graphs of diameter two
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Contractions and hamiltonian line graphs
- On extremal k-supereulerian graphs
- On spanning tree packings of highly edge connected graphs
- On 3-connected Hamiltonian line graphs
- scientific article; zbMATH DE number 682490 (Why is no real title available?)
- A note on collapsible graphs and super-Eulerian graphs
- Collapsible graphs and Hamiltonian connectedness of line graphs
- Spanning cycles in regular matroids without small cocircuits
- scientific article; zbMATH DE number 7021376 (Why is no real title available?)
- scientific article; zbMATH DE number 2177321 (Why is no real title available?)
This page was built for publication: A reduction method to find spanning Eulerian subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3808126)
