On the 2-factor index of a graph

DOI10.1016/j.disc.2006.11.012zbMath1126.05083OpenAlexW2074222613MaRDI QIDQ2455573

Ming-Chu Li, Limning Xiong

Publication date: 25 October 2007

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

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

zbMATH Keywords

2-factoriterated line graphbranch-bond2-factor index

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs ⋮ 2-factors with the bounded number of components in line graphs ⋮ Hamiltonian index is NP-complete ⋮ The existence of even factors in iterated line graphs ⋮ Closure, stability and iterated line graphs with a 2-factor

Cites Work

• Unnamed Item
• Unnamed Item
• Recharacterizing Eulerian: Intimations of new duality
• On the Hamiltonian index
• Hamiltonian iterated line graphs
• The Hamiltonian index of a graph and its branch-bonds
• 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
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On Hamiltonian Line-Graphs

This page was built for publication: On the 2-factor index of a graph