Stability of hereditary graph classes under closure operations
From MaRDI portal
Publication:2852612
Recommendations
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
- Forbidden subgraphs, stability and hamiltonicity
- Closure and stable Hamiltonian properties in claw-free graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- On the Stable Set Polytope of Claw-Free Graphs
Cites work
- Characterizing forbidden pairs for hamiltonian properties
- Closure and Hamiltonian-connectivity of claw-free graphs
- Closure and forbidden pairs for 2-factors
- Closure and forbidden pairs for Hamiltonicity
- Closure concept for 2-factors in claw-free graphs
- Closure concepts: A survey
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Contractibility techniques as a closure concept
- Forbidden subgraphs that imply 2-factors
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- On a closure concept in claw-free graphs
- Strengthening the closure concept in claw-free graphs
Cited in
(4)
This page was built for publication: Stability of hereditary graph classes under closure operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852612)