Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
From MaRDI portal
Publication:1744769
DOI10.1016/j.disc.2017.10.033zbMath1384.05105OpenAlexW2768323990MaRDI QIDQ1744769
Petr Vrána, Zdeněk Ryjáček, Limning Xiong
Publication date: 19 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.10.033
Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)
Related Items
A note on 3-connected hourglass-free claw-free Hamilton-connected graphs, Forbidden pairs for equality of connectivity and edge-connectivity of graphs, The local structure of claw-free graphs without induced generalized bulls
Cites Work
- Unnamed Item
- A twelve vertex theorem for 3-connected claw-free graphs
- On 1-Hamilton-connected claw-free graphs
- Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
- Circumferences and minimum degrees in 3-connected claw-free graphs
- Forbidden subgraphs, stability and hamiltonicity
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- On a closure concept in claw-free graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Hamilton cycles in 3-connected claw-free and net-free graphs
- Hamiltonian claw-free graphs involving minimum degrees
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- On factors of 4-connected claw-free graphs
- Every 3‐connected claw‐free Z 8 ‐free graph is Hamiltonian
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Claw-free 3-connectedP11-free graphs are hamiltonian
- A nine vertex theorem for 3-connected claw- free graphs
- Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
- A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
