scientific article; zbMATH DE number 1496417

zbMath0954.05027MaRDI QIDQ4500611

Ronald J. Gould, Guantao Chen

Publication date: 29 January 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

forbidden subgraphsHamiltonian connected graphs

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, Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs, Hamilton‐connected {claw,net}‐free graphs, II, Hamilton‐connected {claw, net}‐free graphs, I, Recent advances on the Hamiltonian problem: survey III, On Forbidden Pairs Implying Hamilton‐Connectedness, 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected, Toughness, forbidden subgraphs, and Hamilton-connected graphs, Forbidden pairs for \(k\)-connected Hamiltonian graphs