AbstractWe present a structural characterization of the class of acyclic diagraphs which have the Gallai-Milgram-Linial property for clique-covers
Dilworth's theorem establishes a link between a minimal path cover and a maximal antichain in a digr...
International audienceGiven a directed graph, an acyclic set is a set of vertices inducing a directe...
A natural digraph analogue of the graph-theoretic concept of an `independent set' is that of an `acy...
AbstractWe present a structural characterization of the class of acyclic diagraphs which have the Ga...
AbstractThe celebrated Dilworth theorem (Ann. of Math. 51 (1950), 161–166) on the decomposition of f...
decomposition of finite posets was extended by Greene and Kleitman (J. Combin. Theory Ser. A 20 (197...
AbstractWe prove a range of minmax theorems about cycle packing and covering in digraphs whose verti...
International audienceWe prove a range of minmax theorems about cycle packing and covering in digrap...
AbstractWe strengthen the Gallai-Milgram theorem for digraphs with independence number two, and prop...
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
AbstractGallai and Milgram (1960) proved that a digraph with stability number α is spanned by α disj...
AbstractIn this paper the complexity of a number of path cover problems in acyclic digraphs, acyclic...
Abstract. We provide a new proof of a theorem of Saks which is an extension of Greene's Theorem...
AbstractThe Gallai–Milgram theorem states that every directed graph D is spanned by α(D) disjoint di...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
Dilworth's theorem establishes a link between a minimal path cover and a maximal antichain in a digr...
International audienceGiven a directed graph, an acyclic set is a set of vertices inducing a directe...
A natural digraph analogue of the graph-theoretic concept of an `independent set' is that of an `acy...
AbstractWe present a structural characterization of the class of acyclic diagraphs which have the Ga...
AbstractThe celebrated Dilworth theorem (Ann. of Math. 51 (1950), 161–166) on the decomposition of f...
decomposition of finite posets was extended by Greene and Kleitman (J. Combin. Theory Ser. A 20 (197...
AbstractWe prove a range of minmax theorems about cycle packing and covering in digraphs whose verti...
International audienceWe prove a range of minmax theorems about cycle packing and covering in digrap...
AbstractWe strengthen the Gallai-Milgram theorem for digraphs with independence number two, and prop...
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
AbstractGallai and Milgram (1960) proved that a digraph with stability number α is spanned by α disj...
AbstractIn this paper the complexity of a number of path cover problems in acyclic digraphs, acyclic...
Abstract. We provide a new proof of a theorem of Saks which is an extension of Greene's Theorem...
AbstractThe Gallai–Milgram theorem states that every directed graph D is spanned by α(D) disjoint di...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
Dilworth's theorem establishes a link between a minimal path cover and a maximal antichain in a digr...
International audienceGiven a directed graph, an acyclic set is a set of vertices inducing a directe...
A natural digraph analogue of the graph-theoretic concept of an `independent set' is that of an `acy...
DOI
Add to ORKG