2-factors with the bounded number of components in line graphs

DOI10.1016/j.aml.2010.12.018zbMath1207.05166OpenAlexW1986967542MaRDI QIDQ628279

Limning Xiong

Publication date: 10 March 2011

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2010.12.018

zbMATH Keywords

2-factorline graphnumber of componentsbranch-bond

Mathematics Subject Classification ID

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

Related Items (3)

Forbidden subgraphs for supereulerian and Hamiltonian graphs ⋮ Characterization of forbidden subgraphs for the existence of even factors in a graph ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

Cites Work

• Advances on the Hamiltonian problem -- a survey
• On a 2-factor with a specified edge in a graph satisfying the Ore condition
• The Hamiltonian index of a graph and its branch-bonds
• On the 2-factor index of a graph
• A note on 2-factors with two components
• The upper bound of the number of cycles in a 2-factor of a line graph
• A result on Hamiltonian line graphs involving restrictions on induced subgraphs
• Regular factors in K_1,3‐free graphs
• Regular factors in K_1,n free graphs
• Degree conditions for 2-factors
• Hamilton cycles and closed trails in iterated line graphs
• Two-factors with few cycles in claw-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 2-factors with the bounded number of components in line graphs