Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
From MaRDI portal
Publication:2022131
DOI10.1016/j.disc.2021.112350zbMath1469.05100OpenAlexW3132075697MaRDI QIDQ2022131
Publication date: 28 April 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112350
Related Items
Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected, The maximum degree of a minimally Hamiltonian-connected graph, Hamilton‐connected {claw,net}‐free graphs, II, Hamilton‐connected {claw, bull}‐free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A nine point theorem for 3-connected graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- On a closure concept in claw-free graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
- Stability of Hereditary Graph Classes Under Closure Operations
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- Cycles containing 12 vertices in 3-connected cubic graphs
- Closure and stable Hamiltonian properties in claw-free graphs
- An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
- Forbidden subgraphs that imply hamiltonian‐connectedness*
- A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
