Heavy paths and cycles in weighted graphs
Lists
Only you see this
Abstract
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.
BibTeX
@inproceedings{zhang1998heavy,
author = {Shizhou Zhang and Xun Li and Hajo Broersma},
title = {{Heavy paths and cycles in weighted graphs}},
booktitle = {University},
year = {1998},
}Loading related content...