AbstractMaamoun (J. Combin. Theory Ser. B 38 (1985), 97–101) has found an upper bound on the minimum number of elementary directed paths or elementary directed cycles which can partition the arcs of a digraph G. We slightly improve his theorem by specifying the number of elementary directed paths needed in such a partition
The following two optimization problems on acyclic digraph analysis are solved. The first of them co...
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path wit...
AbstractAn acyclic decomposition of a digraph is a partition of the edges into acyclic subgraphs. Tr...
AbstractMaamoun (J. Combin. Theory Ser. B 38 (1985), 97–101) has found an upper bound on the minimum...
AbstractThe problem of partitioning the arcs of a digraph into elementary paths has been considered ...
AbstractIt is shown that in a digraph G, there is an elementary directed path or an elementary direc...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
International audienceIn 1985, Mader conjectured the existence of a function f such that every digra...
AbstractGallai and Milgram (1960) proved that a digraph with stability number α is spanned by α disj...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...
An arc decomposition of the complete digraph Kₙ into t isomorphic subdigraphs is generalized to the...
AbstractA cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) ele...
The following two optimization problems on acyclic digraph analysis are solved. The first of them co...
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path wit...
AbstractAn acyclic decomposition of a digraph is a partition of the edges into acyclic subgraphs. Tr...
AbstractMaamoun (J. Combin. Theory Ser. B 38 (1985), 97–101) has found an upper bound on the minimum...
AbstractThe problem of partitioning the arcs of a digraph into elementary paths has been considered ...
AbstractIt is shown that in a digraph G, there is an elementary directed path or an elementary direc...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
International audienceIn 1985, Mader conjectured the existence of a function f such that every digra...
AbstractGallai and Milgram (1960) proved that a digraph with stability number α is spanned by α disj...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...
An arc decomposition of the complete digraph Kₙ into t isomorphic subdigraphs is generalized to the...
AbstractA cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) ele...
The following two optimization problems on acyclic digraph analysis are solved. The first of them co...
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path wit...
AbstractAn acyclic decomposition of a digraph is a partition of the edges into acyclic subgraphs. Tr...
DOI
Add to ORKG