2-factors and independent sets on claw-free graphs

DOI10.1016/J.DISC.2011.08.020zbMath1232.05183OpenAlexW2148492630MaRDI QIDQ658040

Kenta Ozeki, Roman Kužel, Kiyoshi Yoshimoto

Publication date: 11 January 2012

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

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

zbMATH Keywords

\(l\)-connected claw-free graph with minimum degree at least three

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Circumferences of 2-factors in claw-free graphs ⋮ On all fractional \({(a,b,k)}\)-critical graphs ⋮ 2-factors in claw-free graphs with lower bounds cycle lengths ⋮ 2-factors with bounded number of components in claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
• On a closure concept in claw-free graphs
• Even subgraphs of bridgeless graphs and 2-factors of line graphs
• On the number of components in 2-factors of claw-free graphs
• Claw-free graphs and 2-factors that separate independent vertices
• Regular factors in K_1,3‐free graphs
• Regular factors in K_1,n free graphs
• Closure, 2-factors, and cycle coverings in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs

This page was built for publication: 2-factors and independent sets on claw-free graphs