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

DOI10.1016/j.disc.2008.04.060zbMath1194.05072OpenAlexW2036120997MaRDI QIDQ1025522

Rao Li

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.060

zbMATH Keywords

polynomial time algorithmclaw-free graphhamiltonicityquasi-claw-free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edge Hamiltonian path problem is NP-complete
• Quasi-claw-free graphs
• Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs
• Split Graphs Having Dilworth Number Two
• Graph Classes: A Survey
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers