Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected

DOI10.1007/s00373-015-1598-2zbMath1338.05134OpenAlexW785039738MaRDI QIDQ292269

Shunzhe Zhang, Zhi-quan Hu

Publication date: 13 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1598-2

zbMATH Keywords

claw-free graphsforbidden subgraphscrucial edgesHamilton-connected

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs, Hamilton‐connected {claw, net}‐free graphs, I, On \(s\)-Hamiltonicity of net-free line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonicity in claw-free graphs
• Closure and Hamiltonian-connectivity of claw-free graphs
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Eulerian subgraphs and Hamilton-connected line graphs
• Graphe représentatif des arêtes d'un multigraphe
• On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• Forbidden subgraphs that imply hamiltonian‐connectedness*
• On Eulerian and Hamiltonian Graphs and Line Graphs