Degree and neighborhood conditions for Hamiltonicity of claw-free graphs

DOI10.1016/J.DISC.2017.07.002MaRDI QIDQ2404404zbMATH OpenOpenAlexFDO

Authors Zhi-Hong Chen

Publication date 18 September 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://digitalcommons.butler.edu/cgi/viewcontent.cgi?article=2045&context=facsch_papers

zbMATH Keywords

claw-free graphdegree conditionHamiltonicityneighborhood condition

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Hamiltonicity and degrees of adjacent vertices in claw-free graphs
• Publication:3491603
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
• Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs

Cites work

• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
• Claw-free graphs---a survey
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• Generalized degree conditions for graphs with bounded independence number
• Graph theory with applications
• Graphs without spanning closed trails
• Hamilton cycles in claw-free graphs
• Hamiltonian claw-free graphs involving minimum degrees
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• Hamiltonian properties of graphs with large neighborhood unions
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Hamiltonicity in 3-connected claw-free graphs
• scientific article; zbMATH DE number 4164900 (Why is no real title available?)
• scientific article; zbMATH DE number 1424871 (Why is no real title available?)
• scientific article; zbMATH DE number 6604940 (Why is no real title available?)
• Longest paths and cycles in K1,3-free graphs
• Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
• Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum
• On a closure concept in claw-free graphs
• On dominating and spanning circuits in graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

Cited in

(18)

• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• Extremal problems on the Hamiltonicity of claw-free graphs
• Hamiltonicity of claw-free graphs and Fan-type conditions
• Neighborhood union of independent sets and Hamiltonicity of claw-free graphs
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• On sufficient degree conditions for traceability of claw-free graphs
• Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs
• Degree conditions on claws and modified claws for Hamiltonicity of graphs
• A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs
• Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
• Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
• scientific article; zbMATH DE number 4164900 (Why is no real title available?)
• scientific article; zbMATH DE number 1782860 (Why is no real title available?)
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
• Hamiltonicity and degrees of adjacent vertices in claw-free graphs
• scientific article; zbMATH DE number 5026868 (Why is no real title available?)
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs
• Hamilton-connected claw-free graphs with Ore-degree conditions

This page was built for publication: Degree and neighborhood 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 Q2404404)