The existence of even factors in iterated line graphs

DOI10.1016/j.disc.2007.10.043zbMath1160.05331OpenAlexW2024634642MaRDI QIDQ998486

Limning Xiong

Publication date: 28 January 2009

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

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

zbMATH Keywords

claw-free grapheven factoriterated line graphbranch-bond

Mathematics Subject Classification ID

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

Related Items (6)

Even factors with a bounded number of components in iterated line graphs ⋮ Hamiltonian index is NP-complete ⋮ Nonplanarity of iterated line graphs ⋮ Induced claws and existence of even factors of graphs ⋮ Characterization of forbidden subgraphs for the existence of even factors in a graph ⋮ On the dominating (induced) cycles of iterated line graphs

Cites Work

• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• Connected factors in graphs -- a survey
• Hamiltonian iterated line graphs
• The Hamiltonian index of a graph and its branch-bonds
• On the 2-factor index of a graph
• Linkability in iterated line graphs
• The upper bound of the number of cycles in a 2-factor of a line graph
• The structure and existence of 2-factors in iterated line graphs
• Iterated line graphs are maximally ordered

This page was built for publication: The existence of even factors in iterated line graphs