Heavy Paths and Cycles in Weighted Graphs

摘要

A weighted graph is a graph in which each edge e is assigned a non-negative211u001enumber w(e), called the weight of e. In this paper, some theorems on the 211u001eexistence of long paths and cycles in unweighted graphs are generalized to heavy 211u001epaths and cycles in weighted graphs.