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

zbMATH Open1116.05048MaRDI QIDQ3436693FDOQ3436693

Authors: Jianglu Wang, M. Li 

Publication date: 11 May 2007

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

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cited In (5)

• The cycle in 2-connected \([4,2]\)-graphs
• Title not available (Why is that?)
• Classification of Hamiltonian cycles of a 3-connected graph which contain five contractible edges
• 5-Connected Toroidal Graphs are Hamiltonian-Connected
• Hamiltonian property of 3-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)