Closure and Hamiltonian-connectivity of claw-free graphs
From MaRDI portal
(Redirected from Publication:1296972)
Recommendations
Cites work
Cited in
(16)- A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs
- A note on \(K_ 4\)-closures in hamiltonian graph theory
- The \(*\)-closure for graphs and claw-free graphs
- Maximal \(K_3\)'s and hamiltonicity of 4-connected claw-free graphs
- Generalization of matching extensions in graphs. IV: Closures
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
- On forbidden pairs implying Hamilton-connectedness
- scientific article; zbMATH DE number 5938875 (Why is no real title available?)
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- Closure and Hamilton-connected claw-free hourglass-free graphs
- A closure for 1-Hamilton-connectedness in claw-free graphs
- Stability of hereditary graph classes under closure operations
- Hamilton‐connected {claw, net}‐free graphs, I
- Hamiltonian connectedness in 4-connected hourglass-free 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)