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

DOI10.1080/00207160.2013.838229MaRDI QIDQ2935362zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A note on 2-factors with two components
• Advances on the Hamiltonian problem -- a survey
• Closure, stability and iterated line graphs with a 2-factor
• Degree conditions for 2-factors
• Graph theory with applications
• Hamiltonian index is NP-complete
• Hamiltonian iterated line graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On a 2-factor with a specified edge in a graph satisfying the Ore condition
• On the 2-factor index of a graph
• Regular factors in K_1,3‐free graphs
• Regular factors in K_1,n free graphs
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• 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
• Two-factors with few cycles in claw-free graphs

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)