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

DOI10.1080/00207160.2013.838229zbMATH Open1305.05097OpenAlexW2015484240MaRDI QIDQ2935362FDOQ2935362

Authors: Qingning Wang, Liming 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

Recommendations

• The structure and existence of 2-factors in iterated line graphs
• Even factors with a bounded number of components in iterated line graphs
• Even subgraphs of bridgeless graphs and 2-factors of line graphs
• The branchwidth of graphs and their cycle matroids
• scientific article; zbMATH DE number 1289749
• The existence of even factors in iterated line graphs
• 2-factors with the bounded number of components in line graphs
• Publication:3469130
• On factor-invariant graphs with two cycles
• Minimum number of components of 2-factors in iterated line graphs

zbMATH Keywords

number of componentsline graphweighted graphbranch-bondtwo-factor

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Graph theory with applications
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• 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
• A note on 2-factors with two components
• Degree conditions for 2-factors
• Hamiltonian iterated line graphs
• Hamiltonian index is NP-complete
• The Hamiltonian index of a graph and its branch-bonds
• 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
• Closure, stability and iterated line graphs with a 2-factor

Cited In (1)

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

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

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