Hamilton cycles in 2-connected [5,3]-graphs

MaRDI QIDQ3436693zbMATH OpenFDO

Authors Jianglu Wang, M. Li

Publication date 11 May 2007

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Hamiltonian property of 3-connected \([5,3]\)-graphs
• The cycle in 2-connected \([4,2]\)-graphs
• The Hamiltonicity of \(k\)-connected \([s,t]\)-graphs.
• Hamiltonian cycles in 3‐connected claw‐free graphs
• Cycles through three vertices in 2-connected graphs

Cited in

(8)

• Five-connected toroidal graphs are Hamiltonian
• Classification of Hamiltonian cycles of a 3-connected graph which contain five contractible edges
• Hamiltonian property of 3-connected \([5,3]\)-graphs
• 5-Connected Toroidal Graphs are Hamiltonian-Connected
• scientific article; zbMATH DE number 4193714 (Why is no real title available?)
• scientific article; zbMATH DE number 5239125 (Why is no real title available?)
• The cycle in 2-connected \([4,2]\)-graphs
• On the pancyclicity of 2-connected \([5, 3]\)-graphs

This page was built for publication: Hamilton cycles in 2-connected \([5,3]\)-graphs

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