On 2-factors with long cycles in 3-connected claw-free graphs

DOI10.1016/j.disc.2024.114106zbMath1543.05095MaRDI QIDQ6570036

Zhi-Hong Chen

Publication date: 10 July 2024

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

zbMATH Keywords

cycles2-factorclaw-free graphminimum degreeclosed trail

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Circumferences of 3-connected claw-free graphs
• Circumferences of 2-factors in claw-free graphs
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• 2-factors and independent sets on claw-free graphs
• Circumferences and minimum degrees in 3-connected claw-free graphs
• On a closure concept in claw-free graphs
• Circumferences of 3-connected claw-free graphs. II.
• Circumferences of regular 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: On 2-factors with long cycles in 3-connected claw-free graphs