Cycles in weighted graphs

DOI10.1007/BF01205072zbMath0763.05051OpenAlexW1980692355MaRDI QIDQ1180421

J. A. Bondy, Geng-Hua Fan

Publication date: 27 June 1992

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01205072

zbMATH Keywords

cycleweighted graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (14)

Trigraphs ⋮ Methods for determining cycles of a specific length in undirected graphs with edge weights ⋮ Monophonic convexity in weighted graphs ⋮ On transit functions in weighted graphs ⋮ A characterization of partial blocks in weighted graphs ⋮ A generalization of Menger's theorem ⋮ Heavy cycles in \(k\)-connected weighted graphs with large weighted degree sums ⋮ On vertex-induced weighted Turán problems ⋮ Long cycles, heavy cycles and cycle decompositions in digraphs ⋮ Heavy cycles in 2-connected triangle-free weighted graphs ⋮ Extensions of the Erdős–Gallai theorem and Luo’s theorem ⋮ Connectivity analysis and construction of cyclically balanced graphs ⋮ Heavy cycles in k-connected weighted graphs ⋮ ARC ANALYSIS ALGORITHM (AAA) FOR ARC-WEIGHTED GRAPHS

Cites Work

• Unnamed Item
• Trigraphs
• Relative lengths of paths and cycles in 3-connected graphs
• On maximal paths and circuits of graphs
• Polyhedral decompositions of cubic graphs

This page was built for publication: Cycles in weighted graphs