Finding Hamiltonian cycles in \quasi-claw, K₁,5,K₁,5 + e\-free graphs with bounded Dilworth numbers

DOI10.1016/J.DISC.2008.04.060MaRDI QIDQ1025522zbMATH OpenOpenAlexFDO

Authors 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

claw-free graphhamiltonicitypolynomial time algorithmquasi-claw-free graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1151803
• scientific article; zbMATH DE number 5914958
• Hamilton-connectivity of claw-free graphs with bounded Dilworth numbers.
• Hamiltonian type properties in claw-free \(P_5\)-free graphs
• Hamiltonian cycles in almost claw-free graphs
• Hamiltonian cycles in 2-connected claw-free graphs
• Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles
• scientific article; zbMATH DE number 637341
• On Hamiltonicity of \{claw, net\}-free graphs
• On Hamiltonian cycles in claw-free cubic graphs

Cites work

• Depth-First Search and Linear Graph Algorithms
• Graph Classes: A Survey
• Graph theory
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• Introduction to algorithms
• Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs
• Quasi-claw-free graphs
• Split Graphs Having Dilworth Number Two
• The edge Hamiltonian path problem is NP-complete

Cited in

(4)

• Hamiltonicity of L₁-graphs with bounded Dilworth numbers.
• Hamilton-connectivity of claw-free graphs with bounded Dilworth numbers.
• scientific article; zbMATH DE number 1151803 (Why is no real title available?)
• Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs

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

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