Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
From MaRDI portal
Publication:432724
DOI10.1016/j.disc.2012.02.027zbMath1244.05130OpenAlexW2047981704MaRDI QIDQ432724
Zdeněk Ryjáček, Jakub Teska, Petr Vrána, Roman Kužel
Publication date: 4 July 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.02.027
Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (13)
A note on 3-connected hourglass-free claw-free Hamilton-connected graphs ⋮ Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs ⋮ On 1-Hamilton-connected claw-free graphs ⋮ Hamilton‐connected {claw,net}‐free graphs, II ⋮ Hamilton-connected claw-free graphs with Ore-degree conditions ⋮ Hamilton‐connected {claw, bull}‐free graphs ⋮ Hamilton‐connected {claw, net}‐free graphs, I ⋮ Closure and Hamilton-connected claw-free hourglass-free graphs ⋮ How many conjectures can you stand? A survey ⋮ Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs ⋮ A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs ⋮ Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected ⋮ Stability of Hereditary Graph Classes Under Closure Operations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonian connected claw-free graphs
- Closure and Hamiltonian-connectivity of claw-free graphs
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
- On a closure concept in claw-free graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Closure and stable Hamiltonian properties in claw-free graphs
- On traceability and 2-factors in claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Clique covering and degree conditions for Hamiltonicity in claw-free graphs
This page was built for publication: Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
