scientific article; zbMATH DE number 1496417

zbMATH Open0954.05027MaRDI QIDQ4500611FDOQ4500611

Authors: Guantao Chen, Ronald Gould 

Publication date: 29 January 2001

Title of this publication is not available (Why is that?)

Recommendations

• Hamilton‐connected {claw,net}‐free graphs, II
• Hamilton‐connected {claw, net}‐free graphs, I
• Forbidden subgraphs that imply hamiltonian‐connectedness*

zbMATH Keywords

forbidden subgraphsHamiltonian connected graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cited In (14)

• Recent advances on the Hamiltonian problem: survey III
• Forbidden subgraphs that imply hamiltonian‐connectedness*
• Forbidden configurations for hypohamiltonian graphs
• Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
• On Forbidden Pairs Implying Hamilton‐Connectedness
• Hamilton‐connected {claw, bull}‐free graphs
• Hamilton‐connected {claw, net}‐free graphs, I
• Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
• Toughness, forbidden subgraphs, and Hamilton-connected graphs
• Forbidden pairs for \(k\)-connected Hamiltonian graphs
• Hamilton‐connected {claw,net}‐free graphs, II
• Pseudo-Hamiltonian-connected graphs
• 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
• A HAMILTONIAN CONNECTIVITY PROPERTY OF REGULAR GRAPHS WITH FORBIDDEN SUBGRAPHS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500611)