Closure and Hamiltonian-connectivity of claw-free graphs
From MaRDI portal
Publication:1296972
DOI10.1016/S0012-365X(98)00165-4zbMATH Open0933.05085MaRDI QIDQ1296972FDOQ1296972
Authors: Béla Bollobás, Oliver Riordan, Zdeněk Ryjáček, Akira Saito, R. H. Schelp 
Publication date: 2 November 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (16)
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
- A closure for 1-Hamilton-connectedness in claw-free graphs
- 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
- On forbidden pairs implying Hamilton-connectedness
- Maximal \(K_3\)'s and hamiltonicity of 4-connected claw-free graphs
- 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
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)
