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

B´ ela Bollob´ as, Alex D Scott · 1996

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

math.CO · 2025-07-17 · accept · novelty 7.0

Improved upper bounds: diameter of partition polytopes ≤ κ1+⌈κ2/2⌉, and path/cycle odd-covers of Eulerian graphs ≤ ⌈3Δ/4⌉.

Showing 1 of 1 citing paper.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers math.CO · 2025-07-17 · accept · none · ref 5
Improved upper bounds: diameter of partition polytopes ≤ κ1+⌈κ2/2⌉, and path/cycle odd-covers of Eulerian graphs ≤ ⌈3Δ/4⌉.