Closure and Hamiltonian-connectivity of claw-free graphs

DOI10.1016/S0012-365X(98)00165-4zbMath0933.05085MaRDI QIDQ1296972

Oliver Riordan, Akira Saito, Béla Bollobás, Zdeněk Ryjáček, Richard H. Schelp

Publication date: 2 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

claw-free graphHamiltonian-connected graphclosure

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected ⋮ Generalization of matching extensions in graphs. IV: Closures ⋮ Hamilton‐connected {claw, net}‐free graphs, I ⋮ Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs ⋮ On Forbidden Pairs Implying Hamilton‐Connectedness ⋮ A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs ⋮ The \(*\)-closure for graphs and 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 ⋮ Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs ⋮ Stability of Hereditary Graph Classes Under Closure Operations

Cites Work

• Unnamed Item
• On a closure concept in claw-free graphs
• Graphs with 1-Factors
• Closure and stable Hamiltonian properties in claw-free graphs

This page was built for publication: Closure and Hamiltonian-connectivity of claw-free graphs