Closure and Hamiltonian-connectivity of claw-free graphs
From MaRDI portal
Publication:1296972
DOI10.1016/S0012-365X(98)00165-4zbMATH Open0933.05085MaRDI QIDQ1296972FDOQ1296972
Oliver Riordan, Akira Saito, Béla Bollobás, Zdeněk Ryjáček, R. H. Schelp
Publication date: 2 November 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
Cited In (14)
- A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
- On Forbidden Pairs Implying Hamilton‐Connectedness
- Hamilton‐connected {claw, net}‐free graphs, I
- A note on \(K_ 4\)-closures in hamiltonian graph theory
- The \(*\)-closure for graphs and claw-free graphs
- Stability of hereditary graph classes under closure operations
- Closure and Hamilton-connected claw-free hourglass-free graphs
- Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
- Generalization of matching extensions in graphs. IV: Closures
- Title not available (Why is that?)
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
Recommendations
This page was built for publication: Closure and Hamiltonian-connectivity of claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296972)
