scientific article; zbMATH DE number 1281388

MaRDI QIDQ4240683zbMATH OpenFDO

Authors Guojun Li, Zhenhong Liu

Publication date 19 August 1999

zbMATH Keywords

characterisationHamilton pathvertex dominating cycle

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75)

Recommendations

• Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
• A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
• scientific article; zbMATH DE number 913268
• Highly Hamiltonian \(K_{1,3}P_4\)-free graphs

Cited in

(9)

• On hamiltonian connectedness of \(K_{1,4}\)-free graphs
• Note on the longest paths in \(\{ K_{1,4}, K _{1,4 } + e \}\)-free graphs
• Highly Hamiltonian \(K_{1,3}P_4\)-free graphs
• A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
• Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
• scientific article; zbMATH DE number 637321 (Why is no real title available?)
• scientific article; zbMATH DE number 2187683 (Why is no real title available?)
• Degree-light-free graphs and Hamiltonian cycles
• 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected

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 Q4240683)