Weighted degrees and heavy cycles in weighted graphs

DOI10.1016/j.disc.2009.06.020zbMath1208.05042OpenAlexW1994106452MaRDI QIDQ1045186

Jun Fujisawa

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10126/3021

zbMATH Keywords

weighted graphheavy cycleweighted degree

Mathematics Subject Classification ID

Paths and cycles (05C38) Signed and weighted graphs (05C22)

Related Items (3)

Methods for determining cycles of a specific length in undirected graphs with edge weights ⋮ On vertex-induced weighted Turán problems ⋮ On extremal weighted digraphs with no heavy paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heavy fans, cycles and paths in weighted graphs of large connectivity
• A generalization of Dirac's theorem
• Cycles and paths through specified vertices in k-connected graphs
• A fan type condition for heavy cycles in weighted graphs
• Heavy paths and cycles in weighted graphs
• Long cycles through a linear forest
• Heavy cycles passing through some specified vertices in weighted graphs
• Heavy cycles in weighted graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Weighted degrees and heavy cycles in weighted graphs