Extended Path Partition Conjecture for Semicomplete and Acyclic Compositions

Jiangdong Ai, Stefanie Gerke, Gregory Gutin +1

Let $D$ be a digraph and let $\lambda (D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)…