Forbidden pairs of disconnected graphs for supereulerianity of connected graphs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Forbidden pairs for spanning (closed) trails
Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
On a closure concept in claw-free graphs
Characterizing forbidden pairs for hamiltonian properties
Minimal \(2\)-connected non-Hamiltonian claw-free graphs
Erratum to: ``Forbidden pairs for spanning (closed) trails
Pairs of forbidden subgraphs and 2-connected supereulerian graphs
Supereulerian graphs and excluded induced minors
Forbidden subgraphs for collapsible graphs and supereulerian graphs
Closure operation for even factors on claw-free graphs
Forbidden pairs of disconnected graphs for traceability in connected graphs
Forbidden set of induced subgraphs for 2-connected supereulerian graphs
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
Forbidden subgraphs that imply 2-factors
A pair of forbidden subgraphs and perfect matchings.
A note on Hamiltonian circuits
Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity
A note on graphs spanned by Eulerian graphs
Forbidden subgraphs and the existence of a 2-factor
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
A reduction method to find spanning Eulerian subgraphs
The spanning subgraphs of eulerian graphs
A Note on Sub-Eulerian Graphs
Pairs and triples of forbidden subgraphs and the existence of a 2‐factor
Forbidden pairs of disconnected graphs for 2‐factor of connected graphs

This page was built for publication: Forbidden pairs of disconnected graphs for supereulerianity of connected graphs