Stability of hereditary graph classes under closure operations
DOI10.1002/JGT.21692zbMATH Open1272.05167OpenAlexW1597303155MaRDI QIDQ2852612FDOQ2852612
Authors: Mirka Miller, Zdeněk Ryjáček, Jakub Teska, Petr Vrána, Joe Ryan 
Publication date: 9 October 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21692
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
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75)
Cites Work
- On a closure concept in claw-free graphs
- Closure and Hamiltonian-connectivity of claw-free graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Characterizing forbidden pairs for hamiltonian properties
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Forbidden subgraphs that imply 2-factors
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Closure concepts: A survey
- Strengthening the closure concept in claw-free graphs
- Contractibility techniques as a closure concept
- Closure and forbidden pairs for Hamiltonicity
- Closure and forbidden pairs for 2-factors
- Closure concept for 2-factors 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)
