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

DOI10.1016/J.AML.2010.12.018zbMATH Open1207.05166OpenAlexW1986967542MaRDI QIDQ628279FDOQ628279

Authors: Liming 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

Recommendations

• The upper bound of the number of cycles in a 2-factor of a line graph
• Line graphs containing 2-factors with bounded number of components
• scientific article; zbMATH DE number 5307575
• scientific article; zbMATH DE number 5038486
• scientific article; zbMATH DE number 734469

zbMATH Keywords

number of componentsline graph2-factorbranch-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)

Cites Work

• Graph theory
• On a 2-factor with a specified edge in a graph satisfying the Ore condition
• Advances on the Hamiltonian problem -- a survey
• Regular factors in K_1,3‐free graphs
• Regular factors in K_1,n free graphs
• Title not available (Why is that?)
• A note on 2-factors with two components
• Degree conditions for 2-factors
• The Hamiltonian index of a graph and its branch-bonds
• Hamilton cycles and closed trails in iterated line graphs
• Two-factors with few cycles in claw-free graphs
• On the 2-factor index of a graph
• 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
• Title not available (Why is that?)

Cited In (13)

• Graphs containing every 2-factor
• Forbidden subgraphs for supereulerian and Hamiltonian graphs
• Title not available (Why is that?)
• The upper bound of the number of cycles in a 2-factor of a line graph
• Minimum number of components of 2-factors in iterated line graphs
• Title not available (Why is that?)
• Line graphs containing 2-factors with bounded number of components
• Characterization of forbidden subgraphs for the existence of even factors in a graph
• Even factors with a bounded number of components in iterated line graphs
• Title not available (Why is that?)
• Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs
• Title not available (Why is that?)
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

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

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