Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas Conjecture

Stéphan Thomassé. Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas Conjecture. Journal of Combinatorial Theory, Series A, 83(2):331-333, 2001. [doi]

Abstract

Abstract is missing.