Circumferences of 2-factors in claw-free graphs

DOI10.1016/J.DISC.2012.08.005MaRDI QIDQ383757zbMATH OpenOpenAlexFDO

Authors Roman Čada, Shuya Chiba

Publication date 6 December 2013

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

minimum degreecircumferenceclaw-free graphHamiltonian2-factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 2191996
• 2-factors in claw-free graphs
• 2-factors in claw-free graphs with lower bounds cycle lengths
• scientific article; zbMATH DE number 1766873
• Two-factors with few cycles in claw-free graphs

Cites work

• scientific article; zbMATH DE number 4110721 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 2191996 (Why is no real title available?)
• 2-factors and independent sets on claw-free graphs
• 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
• Claw-free graphs and 2-factors that separate independent vertices
• Closure, 2-factors, and cycle coverings in claw-free graphs
• Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
• Hamilton cycles in 5-connected line graphs
• Hamiltonian results inK1,3-free graphs
• Longest cycles in regular 2-connected claw-free graphs
• 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
• On the number of components in 2-factors of claw-free graphs
• Regular factors in K_1,3‐free graphs
• Regular factors in K_1,n free graphs

Cited in

(5)

• scientific article; zbMATH DE number 5914889 (Why is no real title available?)
• scientific article; zbMATH DE number 2191996 (Why is no real title available?)
• On 2-factors with long cycles in 3-connected claw-free graphs
• Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
• ID-factor-critical and claw-free graphs of diameter 2

This page was built for publication: Circumferences of 2-factors in claw-free graphs

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