3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected

DOI10.1007/s00373-013-1344-6zbMath1298.05189OpenAlexW2004434341MaRDI QIDQ742625

Ronald J. Gould, Paul Wrayno, Susan Janiszewski, Qiuju Bian, Steven La Fleur, Paul S. Horn

Publication date: 19 September 2014

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

Full work available at URL: https://doi.org/10.1007/s00373-013-1344-6

zbMATH Keywords

3-connectedclosureHamilton-connectedclaw-freedominating

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (9)

A note on 3-connected hourglass-free claw-free Hamilton-connected graphs ⋮ Hamiltonian extendable graphs ⋮ Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs ⋮ The maximum degree of a minimally Hamiltonian-connected graph ⋮ Hamilton‐connected {claw,net}‐free graphs, II ⋮ Hamilton‐connected {claw, bull}‐free graphs ⋮ Hamilton‐connected {claw, net}‐free graphs, I ⋮ Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs ⋮ Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonicity in claw-free graphs
• 9-connected claw-free graphs are Hamilton-connected
• Characterizing forbidden pairs for hamiltonian properties
• On graph closures
• Forbidden subgraphs that imply hamiltonian‐connectedness*
• On Forbidden Pairs Implying Hamilton‐Connectedness

This page was built for publication: 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected