Minimum number of components of 2-factors in iterated line graphs

DOI10.1007/s40840-015-0145-xzbMath1339.05206OpenAlexW754724816MaRDI QIDQ726529

Limning Xiong, Sheng-mei Lv

Publication date: 11 July 2016

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-015-0145-x

zbMATH Keywords

2-factoriterated line graphHamiltonian indexcut-branch

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
• Hamiltonian index is NP-complete
• Closure, stability and iterated line graphs with a 2-factor
• Hamiltonian iterated line graphs
• Recent advances on the Hamiltonian problem: survey III
• Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Hamilton cycles and closed trails in iterated line graphs

This page was built for publication: Minimum number of components of 2-factors in iterated line graphs