A reduction method to find spanning Eulerian subgraphs
From MaRDI portal
Publication:3808126
Recommendations
Cites work
- 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?)
- Contractions of graphs with no spanning Eulerian subgraphs
- Graph theory with applications
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On Spanning and Dominating Circuits in Graphs
Cited in
(only showing first 100 items - show all)- Spectral and extremal conditions for supereulerian graphs
- On the Hamiltonian index
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
- Spanning 3-connected index of graphs
- Spanning trails with variations of Chvátal-Erdős conditions
- Properties of Catlin's reduced graphs and supereulerian graphs
- Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
- The Hamiltonian index of a graph and its branch-bonds
- The supereulerian graphs in the graph family \(C(l,k)\)
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
- Traceability on 2-connected line graphs
- A simple upper bound for the hamiltonian index of a graph
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Circumferences of 3-connected claw-free graphs
- On (s,t)-supereulerian graphs in locally highly connected graphs
- How many conjectures can you stand? A survey
- Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
- A condition on Hamilton-connected line graphs
- Spanning trees and spanning Eulerian subgraphs with small degrees
- On 2-factors with long cycles in 3-connected claw-free graphs
- On \(s\)-Hamiltonian-connected line graphs
- Cycle intersection graphs and minimum decycling sets of even graphs
- Hitting time for \(k\) edge-disjoint spanning trees in a random graph
- Group connectivity of graphs with diameter at most 2
- A note on minimum degree conditions for supereulerian graphs
- On the line graph of a graph with diameter 2
- Catlin's reduced graphs with small orders
- Forbidden subgraphs for supereulerian and Hamiltonian graphs
- Hamiltonicity of 6-connected line graphs
- Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
- The Chvátal-Erdős condition for group connectivity in graphs
- On spanning tree packings of highly edge connected graphs
- Collapsible subgraphs of a 4-edge-connected graph
- Supereulerian graphs and excluded induced minors
- Degree sequence and supereulerian graphs
- 2-factors with bounded number of components in claw-free graphs
- Fan-type conditions for spanning Eulerian subgraphs
- scientific article; zbMATH DE number 7021376 (Why is no real title available?)
- On s-Hamiltonicity of net-free line graphs
- On 3-connected Hamiltonian line graphs
- Hamiltonian line graphs with local degree conditions
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- Graphs without spanning closed trails
- Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- On dominating and spanning circuits in graphs
- Connected odd factors of graphs
- Group connectivity and matchings
- Degree sums of adjacent vertices for traceability of claw-free graphs
- Forbidden subgraphs and weak locally connected graphs
- Collapsible graphs and Hamiltonian connectedness of line graphs
- A note on collapsible graphs and super-Eulerian graphs
- On \(s\)-Hamiltonian line graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- 5-Cycle Double Covers, 4-Flows, and Catlin Reduction
- On the s-hamiltonianicity of an hourglass-free line graph
- Spanning cycles in regular matroids without small cocircuits
- Hamilton‐connected {claw, net}‐free graphs, I
- Supereulerian graphs with constraints on the matching number and minimum degree
- Hamiltonicity of 3-connected line graphs
- On \(s\)-Hamiltonian line graphs of claw-free graphs
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
- On spanning disjoint paths in line graphs
- Hamiltonian connectedness in 3-connected line graphs
- Spanning trails in essentially 4-edge-connected graphs
- Compatible spanning circuits and forbidden induced subgraphs
- On hamiltonian line graphs of hypergraphs
- Spanning trails containing given edges
- The reduction of graph families closed under contraction
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
- Eulerian subgraphs and \(S\)-connectivity of graphs
- Duality in graph families
- Traceability of line graphs
- Circumferences of 3-connected claw-free graphs. II.
- Degree sum and Hamiltonian-connected line graphs
- Parity and disparity subgraphs
- Collapsible graphs and reductions of line graphs
- Graphs with a 3-cycle-2-cover
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
- Hamiltonicity in 3-connected claw-free graphs
- Reduced graphs of diameter two
- Forbidden pairs of disconnected graphs for supereulerianity of connected graphs
- Squares of graphs are optimally \((s, t)\)-supereulerian
- Eulerian subgraphs and Hamilton-connected line graphs
- Strengthened Ore conditions for (s, t)-supereulerian graphs
- scientific article; zbMATH DE number 682490 (Why is no real title available?)
- 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
- On \(( s , t )\)-supereulerian graphs with linear degree bounds
- Polynomially determine if a graph is \((s,3)\)-supereulerian
- scientific article; zbMATH DE number 6604940 (Why is no real title available?)
- scientific article; zbMATH DE number 2177321 (Why is no real title available?)
- Collapsible biclaw-free graphs
- Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
- Pancyclicity of hamiltonian line graphs
- Chvátal-Erdős conditions and almost spanning trails
- Supereulerian graphs, independent sets, and degree-sum conditions
- Forbidden subgraphs on Hamiltonian index
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)
