A proof of a conjecture of bondy concerning paths in weighted digraphs
Our aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dirac to edge-weighted digraphs: if every vertex has out-weight at least 1 then the digraph contains a path of weight at least 1. We also give several related conjectures and results concerning heavy cycles in edge-weighted digraphs. © 1996 Academic Press, Inc.
Journal of Combinatorial Theory. Series B
Bollobás, B., & Scott, A. (1996). A proof of a conjecture of bondy concerning paths in weighted digraphs. Journal of Combinatorial Theory. Series B, 66 (2), 283-292. https://doi.org/10.1006/jctb.1996.0021