Forbidden subgraphs that imply hamiltonian‐connectedness*

DOI10.1002/jgt.10034zbMath0999.05067OpenAlexW1575556277MaRDI QIDQ4539874

Andreas Huck, Ralph J. Faudree, H. Trommel, Hajo J. Broersma, Henk Jan Veldman

Publication date: 11 July 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/forbidden-subgraphs-that-imply-hamiltonianconnectedness(1a4506f7-4af7-42d9-8afb-9b40a0431a12).html

zbMATH Keywords

Hamiltonian-connected

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected, Hamiltonian extendable graphs, Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs, Forbidden pairs and the existence of a spanning Halin subgraph, Hamilton‐connected {claw,net}‐free graphs, II, Hamilton‐connected {claw, bull}‐free graphs, Hamilton‐connected {claw, net}‐free graphs, I, Forbidden induced subgraphs for star-free graphs, Recent advances on the Hamiltonian problem: survey III, Forbidden Subgraphs Generating Almost the Same Sets, On Forbidden Pairs Implying Hamilton‐Connectedness, Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected, 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected, Forbidden pairs for \(k\)-connected Hamiltonian graphs, Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs

Cites Work

• Hamiltonicity in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Unnamed Item