AbstractIt is shown that in a digraph G, there is an elementary directed path or an elementary directed cycle meeting all inclusion-maximal demi-cocycles of G. This theorem is used to obtain an upper bound on the cardinality of a minimal partition of the arc set of G into directed paths and cycles
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
A digraph D is called semicomplete if for each pair of distinct vertices u, v {dollar}\\in{dollar} V...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractIt is shown that in a digraph G, there is an elementary directed path or an elementary direc...
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 ...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
An arc decomposition of the complete digraph Kₙ into t isomorphic subdigraphs is generalized to the...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
AbstractA cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) ele...
AbstractThe Path Partition Conjecture for digraphs states that for every digraph D, and every choice...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
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...
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
A digraph D is called semicomplete if for each pair of distinct vertices u, v {dollar}\\in{dollar} V...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
AbstractIt is shown that in a digraph G, there is an elementary directed path or an elementary direc...
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 ...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
An arc decomposition of the complete digraph Kₙ into t isomorphic subdigraphs is generalized to the...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
AbstractA cycle packing in a (directed) multigraph is a vertex disjoint collection of (directed) ele...
AbstractThe Path Partition Conjecture for digraphs states that for every digraph D, and every choice...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
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...
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
A digraph D is called semicomplete if for each pair of distinct vertices u, v {dollar}\\in{dollar} V...
AbstractIt is shown that there exists a positiveεso that for any integerk, every directed graph with...
DOI
Add to ORKG