Circumferences of 3-connected claw-free graphs. II.

DOI10.1016/J.DISC.2017.04.010zbMath1365.05048OpenAlexW4206402070MaRDI QIDQ2359952

Zhi-Hong Chen

Publication date: 23 June 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.04.010

zbMATH Keywords

claw-free graphcircumferenceminimum degreePetersen graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Circumferences of 3-connected claw-free graphs
• Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
• Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
• Circumferences and minimum degrees in 3-connected claw-free graphs
• Graphs without spanning closed trails
• On a closure concept in claw-free graphs
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Circumferences of regular claw-free graphs
• Hamiltonicity in 3-connected claw-free graphs
• Longest paths and cycles in K1,3-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: Circumferences of 3-connected claw-free graphs. II.