Stability of Hereditary Graph Classes Under Closure Operations
From MaRDI portal
Publication:2852612
DOI10.1002/jgt.21692zbMath1272.05167OpenAlexW1597303155MaRDI QIDQ2852612
Mirka Miller, Petr Vrána, Zdeněk Ryjáček, Jakub Teska, Joseph F. 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
Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Hamilton‐connected {claw,net}‐free graphs, II, Hamilton‐connected {claw, bull}‐free graphs, Hamilton‐connected {claw, net}‐free graphs, I, Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
Cites Work
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Closure and forbidden pairs for 2-factors
- Closure concept for 2-factors in claw-free graphs
- Closure and Hamiltonian-connectivity of claw-free graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- On a closure concept in claw-free graphs
- Characterizing forbidden pairs for hamiltonian properties
- Closure and forbidden pairs for Hamiltonicity
- Closure concepts: A survey
- Forbidden subgraphs that imply 2-factors
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Contractibility techniques as a closure concept
- Strengthening the closure concept in claw-free graphs
