The *-closure for graphs and claw-free graphs
From MaRDI portal
Publication:998440
DOI10.1016/J.DISC.2007.10.023zbMATH Open1186.05076OpenAlexW2048853220MaRDI QIDQ998440FDOQ998440
Authors: Roman Čada 
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.023
Recommendations
Cites Work
- Graph theory
- On a closure concept in claw-free graphs
- Closure and Hamiltonian-connectivity of claw-free graphs
- Degree conditions on induced claws
- Closure and stable Hamiltonian properties in claw-free graphs
- Strengthening the closure concept in claw-free graphs
- 9-connected claw-free graphs are Hamilton-connected
- Closure concepts for claw-free graphs
- A note on \(K_ 4\)-closures in hamiltonian graph theory
Cited In (13)
- A note on degree conditions for traceability in locally claw-free graphs
- Closure concept for 2-factors in claw-free graphs
- A note on the computation on the k-closure of a graph
- Claw-free graphs with complete closure
- Title not available (Why is that?)
- A twelve vertex theorem for 3-connected claw-free graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- Degree conditions on induced claws
- 0-dual closures for several classes of graphs
- Contractibility techniques as a closure concept
- The closure concept and stability for \(Y_3V_3\)-free graphs
- \(\beta \)-degree closures for graphs
This page was built for publication: The \(*\)-closure for graphs and claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998440)
