A weighted graph is a graph in which each edge $e$ is assigned a non-negative number $w(e)$, called the weight of $e$. 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.
|Place of Publication||Enschede|
|Number of pages||13|
|Publication status||Published - 1998|
|Name||Memorandum Faculteit TW|