Induced nets and Hamiltonicity of claw-free graphs

DOI10.1007/s00373-020-02265-7zbMath1475.05101arXiv1803.09416OpenAlexW3130672666MaRDI QIDQ2045363

Jun Fujisawa, Shuya Chiba

Publication date: 12 August 2021

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

Full work available at URL: https://arxiv.org/abs/1803.09416

zbMATH Keywords

Hamiltonian cyclesclaw-free graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II ⋮ Hamilton circuits and essential girth of claw free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
• Graph whose edges are in small cycles
• On a closure concept in claw-free graphs
• Advances on the Hamiltonian problem -- a survey
• Minimal \(2\)-connected non-Hamiltonian claw-free graphs
• Recent advances on the Hamiltonian problem: survey III
• Graph Theory
• Longest paths and cycles in K1,3-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Updating the hamiltonian problem—A survey
• Hamiltonicity and forbidden subgraphs in 4‐connected graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Induced nets and Hamiltonicity of claw-free graphs