Local degree conditions for Hamiltonicity of claw-free graphs

DOI10.1007/S00373-024-02871-9MaRDI QIDQ6661728zbMATH OpenFDO

Authors Wangyi Shang, Shenggui Zhang, Binlong Li, Xia Liu

Publication date 13 January 2025

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

Full work available at URL https://doi.org/10.1007/S00373-024-02871-9

zbMATH Keywords

claw-free graphsclosureHamiltonicitylocal degree conditions

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
• Induced nets and Hamiltonicity of claw-free graphs
• Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• scientific article; zbMATH DE number 4183448

Cites work

• A localization method in Hamiltonian graph theory
• A reduction method to find spanning Eulerian subgraphs
• Graph theory
• Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
• Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
• Longest paths and cycles in K1,3-free graphs
• On a closure concept in claw-free graphs
• On dominating and spanning circuits in graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Some localization theorems on Hamiltonian circuits
• Some Theorems on Abstract Graphs
• Super-Eulerian graphs and the Petersen graph. II
• Supereulerian graphs and excluded induced minors

This page was built for publication: Local degree conditions for Hamiltonicity of claw-free graphs

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