Heavy paths and cycles in weighted graphs

S. Zhang, X. Li, H.J. Broersma

Research output: Book/ReportReportProfessional

54 Downloads (Pure)


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.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversiteit Twente
Number of pages13
Publication statusPublished - 1998

Publication series

NameMemorandum Faculteit TW
PublisherUniversiteit Twente


  • MSC-05C35
  • MSC-05C38
  • MSC-05C45


Dive into the research topics of 'Heavy paths and cycles in weighted graphs'. Together they form a unique fingerprint.

Cite this