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

DOI10.1016/J.DISC.2024.114106MaRDI QIDQ6570036zbMATH OpenFDO

Authors Zhi-Hong Chen

Publication date 10 July 2024

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

minimum degreeclaw-free graphclosed trailcycles2-factor

Mathematics Subject Classification ID

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

Recommendations

• 2-factors in claw-free graphs
• Circumferences of 2-factors in claw-free graphs
• 2-factors in claw-free graphs with lower bounds cycle lengths
• 2-factors in claw-free graphs
• 2-factors with bounded number of components in claw-free graphs

Cites work

• scientific article; zbMATH DE number 6604940 (Why is no real title available?)
• 2-factors and independent sets on claw-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• Circumferences and minimum degrees in 3-connected claw-free graphs
• Circumferences of 2-factors in claw-free graphs
• Circumferences of 3-connected claw-free graphs
• Circumferences of 3-connected claw-free graphs. II.
• Circumferences of regular claw-free graphs
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• Graph theory with applications
• Longest paths and cycles in K1,3-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On a closure concept in claw-free graphs

This page was built for publication: On 2-factors with long cycles in 3-connected claw-free graphs

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