Learn More
The Path Partition Conjecture for digraphs states that for every digraph D, and every choice of positive integers λ 1 , λ 2 such that λ 1 + λ 2 equals the order of a longest directed path in D, there exists a partition of D in two subdigraphs D 1 , D 2 such that the order of the longest path in D i is at most λ i for i = 1, 2. We present sufficient(More)
  • 1