Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles

DOI10.1007/s00373-015-1605-7zbMath1339.05345MaRDI QIDQ295270

F. Blanchet-Sadri, M. Dambrine

Publication date: 13 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1605-7

zbMATH Keywords

claw-free graph; Hamiltonian graph; line graph; \(o\)-heavy graph

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C40: Connectivity

05C45: Eulerian and Hamiltonian graphs

05C76: Graph operations (line graphs, products, etc.)