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

DOI10.1016/J.DISC.2012.07.005zbMATH Open1251.05145OpenAlexW1997242949MaRDI QIDQ456652FDOQ456652

Authors: Runli Tian, Zhaohong Niu, Liming 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

Recommendations

• 2-factors in claw-free graphs
• Two-factors with few cycles in claw-free graphs
• On components of 2-factors in claw-free graphs
• 2-factors in claw-free graphs
• On 2-factors in claw-free graphs

zbMATH Keywords

line graphclaw-free graph2-factor

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)

Cites Work

• Graph theory
• 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
• Title not available (Why is that?)
• Closure, 2-factors, and cycle coverings in claw-free graphs

Cited In (6)

• Two operations on a graph preserving the (non)existence of 2-factors in its line graph.
• On 2-factors in 5-cycle connected claw-free graphs
• Computing Sharp 2-Factors in Claw-Free Graphs
• 2-factors in claw-free graphs with lower bounds cycle lengths
• On 2-factors with given properties in claw-free graphs
• Computing sharp 2-factors in claw-free graphs

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

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