scientific article; zbMATH DE number 5914958

MaRDI QIDQ3011807zbMATH OpenFDO

Authors Rao Li

Publication date 29 June 2011

zbMATH Keywords

Hamiltonian cyclepolynomial algorithmquasi-claw-free graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Hamiltonian cycles in almost claw-free graphs
• On Hamiltonian cycles in claw-free cubic graphs
• scientific article; zbMATH DE number 637341
• Hamilton cycles in claw-free graphs
• Hamiltonian cycles in 2-connected claw-free graphs
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• Hamiltonicity of 2-connected quasi-claw-free graphs
• Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs
• Hamiltonian cycles in 3‐connected claw‐free graphs
• Hamiltonian cycles in 3-connected claw-free graphs

Cited in

(1)

• Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers

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