Heavy paths and cycles in weighted graphs

A weighted graph is a graph in which each edge e is assigned a non-negative
number , called the weight of . In this paper, some theorems on the
existence of long paths and cycles in unweighted graphs are generalized to heavy
paths and cycles in weighted graphs.