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

DOI10.1007/s10587-014-0151-4zbMath1349.05177OpenAlexW2026224802MaRDI QIDQ5249638

Limning Xiong, Mingqiang An, Runli Tian, Guifu Su, Hao Li, Hong-Jian Lai

Publication date: 6 May 2015

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/144159

zbMATH Keywords

2-factorclaw-free graphline graph\(N^{2}\)-locally connected

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• On 2-factors in claw-free graphs whose edges are in small cycles
• 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

This page was built for publication: Two operations on a graph preserving the (non)existence of 2-factors in its line graph