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

DOI10.1007/s00373-015-1605-7zbMath1339.05345OpenAlexW927804063MaRDI 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 graphHamiltonian graphline graph\(o\)-heavy graph

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On the dominating (induced) cycles of iterated line graphs

Cites Work

• Unnamed Item
• Degree conditions on induced claws
• On a closure concept in claw-free graphs
• Line graphs and forbidden induced subgraphs
• Forbidden subgraphs that imply 2-factors
• Every 3‐connected claw‐free Z ₈ ‐free graph is Hamiltonian
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs