Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs

DOI10.1080/00207160.2013.838229zbMath1305.05097OpenAlexW2015484240MaRDI QIDQ2935362

Qingning Wang, Limning Xiong

Publication date: 29 December 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2013.838229

zbMATH Keywords

line graphweighted graphnumber of componentsbranch-bondtwo-factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian index is NP-complete
• Closure, stability and iterated line graphs with a 2-factor
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• Advances on the Hamiltonian problem -- a survey
• Hamiltonian iterated line graphs
• 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
• Regular factors in K_1,3‐free graphs
• Regular factors in K_1,n free graphs
• Degree conditions for 2-factors
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Two-factors with few cycles in claw-free graphs

This page was built for publication: Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs