A proof of a conjecture of Bondy concerning paths in weighted digraphs

DOI10.1006/jctb.1996.0021zbMath0881.05072OpenAlexW2059178319MaRDI QIDQ1924127

Béla Bollobás, Alexander D. Scott

Publication date: 14 October 1996

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6ac423580fd3e875c168e15271f7d350edf1fb0a

zbMATH Keywords

pathheavy cyclestheorem of Diracconjecture of Bondyedge-weighted digraphsout-weight

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Large Feedback Arc Sets, High Minimum Degree Subgraphs, and Long Cycles in Eulerian Digraphs ⋮ On vertex-induced weighted Turán problems ⋮ Long cycles, heavy cycles and cycle decompositions in digraphs ⋮ On extremal weighted digraphs with no heavy paths ⋮ Notes on heavy cycles in weighted digraphs ⋮ Note on long paths in Eulerian digraphs ⋮ Path and cycle decompositions of dense graphs

This page was built for publication: A proof of a conjecture of Bondy concerning paths in weighted digraphs