Closure and Hamilton-connected claw-free hourglass-free graphs
From MaRDI portal
Publication:897238
DOI10.1007/S00373-014-1490-5zbMATH Open1327.05187OpenAlexW2043109823MaRDI QIDQ897238FDOQ897238
Authors: N. E. Zubov 
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1490-5
Recommendations
- Closure and Hamiltonian-connectivity of claw-free graphs
- Closure and stable Hamiltonian properties in claw-free graphs
- A closure for 1-Hamilton-connectedness in claw-free graphs
- Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Hamiltonian connectedness in claw-free graphs
- Hamiltonian connectedness in claw-free graphs
- Hamiltonian connected claw-free graphs
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
- Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs
Cites Work
- Graph theory
- On a closure concept in claw-free graphs
- Eulerian subgraphs and Hamilton-connected line 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
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Closure and stable Hamiltonian properties in claw-free graphs
- A closure for 1-Hamilton-connectedness in claw-free graphs
Cited In (3)
This page was built for publication: Closure and Hamilton-connected claw-free hourglass-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897238)
