On 2-factors in claw-free graphs whose edges are in small cycles

DOI10.1016/J.DISC.2012.07.005zbMath1251.05145OpenAlexW1997242949MaRDI QIDQ456652

Runli Tian, Zhaohong Niu, Limning Xiong

Publication date: 16 October 2012

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

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

zbMATH Keywords

2-factorclaw-free graphline graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Two operations on a graph preserving the (non)existence of 2-factors in its line graph

Cites Work

• 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
• Closure, 2-factors, and cycle coverings in claw-free graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On 2-factors in claw-free graphs whose edges are in small cycles