On stability of Hamilton-connectedness under the 2-closure in claw-free graphs

DOI10.1002/jgt.20497zbMath1228.05198OpenAlexW2071950338MaRDI QIDQ3081310

Petr Vrána, Zdeněk Ryjáček

Publication date: 7 March 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20497

zbMATH Keywords

claw-free graphclosureHamilton-connected

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected ⋮ On 1-Hamilton-connected claw-free graphs ⋮ Hamilton‐connected {claw, net}‐free graphs, I ⋮ Closure and Hamilton-connected claw-free hourglass-free graphs ⋮ Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs ⋮ How many conjectures can you stand? A survey ⋮ On Forbidden Pairs Implying Hamilton‐Connectedness ⋮ A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs

Cites Work

• Unnamed Item
• Closure and Hamiltonian-connectivity of claw-free graphs
• 9-connected claw-free graphs are Hamilton-connected
• A strengthening of Ben Rebea's lemma
• On a closure concept in claw-free graphs
• On graph closures
• Hamilton connectivity of line graphs and claw‐free graphs