AbstractLinial conjectured that Greene—Kleitman's theorem can be extended to general digraphs. We prove a stronger conjecture of Berge for digraphs having k-optimal path partitions consisting of ‘long’ paths. The same method yields known results for acyclic digraphs, and extensions of various theorems of Greene and Frank to acyclic digraphs
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
AbstractIt is proved that for every k-optimal path partition of a directed graph in which no two cyc...
AbstractA digraph D verifies the Chvátal–Erdős conditions if α(D)⩽κ(D), where α(D) is the stability ...
Abstract. We provide a new proof of a theorem of Saks which is an extension of Greene's Theorem...
AbstractBerge’s strong path partition conjecture from 1982 generalizes and extends Dilworth’s theore...
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilw...
Let k be a positive integer and let D be a digraph. A path partition P of D is a set of vertex-disjo...
decomposition of finite posets was extended by Greene and Kleitman (J. Combin. Theory Ser. A 20 (197...
Berge's elegant dipath partition conjecture from 1982 states that in a dipath partition P of the ver...
AbstractWe consider the so-called Path Partition Conjecture for digraphs which states that for every...
AbstractBerge's conjecture from 1982 on path partitions in directed graphs generalizes and extends D...
AbstractThe Path Partition Conjecture for digraphs states that for every digraph D, and every choice...
AbstractThe celebrated Dilworth theorem (Ann. of Math. 51 (1950), 161–166) on the decomposition of f...
AbstractIt is proved that for every k-optimal path partition of a diagraph in which each component c...
Uma partição em caminhos de um grafo dirigido é uma partição do conjunto de vértices deste grafo em ...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
AbstractIt is proved that for every k-optimal path partition of a directed graph in which no two cyc...
AbstractA digraph D verifies the Chvátal–Erdős conditions if α(D)⩽κ(D), where α(D) is the stability ...
Abstract. We provide a new proof of a theorem of Saks which is an extension of Greene's Theorem...
AbstractBerge’s strong path partition conjecture from 1982 generalizes and extends Dilworth’s theore...
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilw...
Let k be a positive integer and let D be a digraph. A path partition P of D is a set of vertex-disjo...
decomposition of finite posets was extended by Greene and Kleitman (J. Combin. Theory Ser. A 20 (197...
Berge's elegant dipath partition conjecture from 1982 states that in a dipath partition P of the ver...
AbstractWe consider the so-called Path Partition Conjecture for digraphs which states that for every...
AbstractBerge's conjecture from 1982 on path partitions in directed graphs generalizes and extends D...
AbstractThe Path Partition Conjecture for digraphs states that for every digraph D, and every choice...
AbstractThe celebrated Dilworth theorem (Ann. of Math. 51 (1950), 161–166) on the decomposition of f...
AbstractIt is proved that for every k-optimal path partition of a diagraph in which each component c...
Uma partição em caminhos de um grafo dirigido é uma partição do conjunto de vértices deste grafo em ...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
AbstractIt is proved that for every k-optimal path partition of a directed graph in which no two cyc...
AbstractA digraph D verifies the Chvátal–Erdős conditions if α(D)⩽κ(D), where α(D) is the stability ...
DOI
Add to ORKG