AbstractThe purpose of this note is to prove a theorem on acyclic digraphs, conjectured by Linial (J. Combin. Theory Ser. A, 30 (1981), 331–334), which includes Greene's theorem (J. Combin. Theory Ser. A, 20 (1976), 69–79) on decompositions of a partially ordered set into antichains
The grid theorem, originally proved by Robertson and Seymour in Graph Minors V in 1986, is one of th...
AbstractIn this paper, we study planar directed ordered connected acyclic graphs, in particular grap...
AbstractLinial conjectured that Greene—Kleitman's theorem can be extended to general digraphs. We pr...
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...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
AbstractUsing the minimal cost flow algorithm of Ford and Fulkerson and the notion of orthogonality ...
AbstractAn acyclic decomposition of a digraph is a partition of the edges into acyclic subgraphs. Tr...
This letter gives a new necessary and sufficient condition to determine whether a directed graph is ...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilw...
AbstractA common generalization of the theorems of Greene and Greene and Kleitman is presented. This...
Abstract. Let G and D, respectively, denote the partially ordered sets of homomorphism classes of fi...
Acyclic subdigraphs and linear orderings : polytopes, facets and a cutting plane algorithm / Martin ...
The acyclic chromatic number of a directed graph D, denoted χA(D), is the min-imum positive integer ...
The grid theorem, originally proved by Robertson and Seymour in Graph Minors V in 1986, is one of th...
AbstractIn this paper, we study planar directed ordered connected acyclic graphs, in particular grap...
AbstractLinial conjectured that Greene—Kleitman's theorem can be extended to general digraphs. We pr...
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...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
AbstractUsing the minimal cost flow algorithm of Ford and Fulkerson and the notion of orthogonality ...
AbstractAn acyclic decomposition of a digraph is a partition of the edges into acyclic subgraphs. Tr...
This letter gives a new necessary and sufficient condition to determine whether a directed graph is ...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilw...
AbstractA common generalization of the theorems of Greene and Greene and Kleitman is presented. This...
Abstract. Let G and D, respectively, denote the partially ordered sets of homomorphism classes of fi...
Acyclic subdigraphs and linear orderings : polytopes, facets and a cutting plane algorithm / Martin ...
The acyclic chromatic number of a directed graph D, denoted χA(D), is the min-imum positive integer ...
The grid theorem, originally proved by Robertson and Seymour in Graph Minors V in 1986, is one of th...
AbstractIn this paper, we study planar directed ordered connected acyclic graphs, in particular grap...
AbstractLinial conjectured that Greene—Kleitman's theorem can be extended to general digraphs. We pr...
DOI
Add to ORKG