AbstractA block of a path in a digraph is a maximal directed subpath. We prove that any n-chromatic digraph contains a path of length n-1 consisting of two blocks, one of which has length one.We then study the general problem of whether an n-chromatic digraph contains a path of length n-1 consisting of two blocks of specified lengths
AbstractWe consider the so-called Path Partition Conjecture for digraphs which states that for every...
International audienceA (k1 + k2)-bispindle is the union of k1 (x, y)-dipaths and k2 (y, x)-dipaths,...
In this paper, we show that every oriented path with three blocks of order n 4, is contained in ever...
AbstractA block of a path in a digraph is a maximal directed subpath. We prove that any n-chromatic ...
AbstractWe show that every oriented path of order n⩾4 with two blocks is contained in every n-chroma...
International audienceWe show that every oriented path of order n>=4 with two blocks is contained in...
We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromat...
In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first trea...
International audienceLet $f(k)$ be the smallest integer such that every $f(k)$-chromatic digraph co...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
AbstractIn [2] Berge asked: In a digraph, does there exist an optimal coloring and a path meeting ea...
AbstractSay a digraph is k-free if it has no directed cycles of length at most k, for k∈Z+. Thomassé...
AbstractIn this paper it is proved that the path number of the complete symmetric bipartite digraph ...
AbstractWe consider the so-called Path Partition Conjecture for digraphs which states that for every...
International audienceA (k1 + k2)-bispindle is the union of k1 (x, y)-dipaths and k2 (y, x)-dipaths,...
In this paper, we show that every oriented path with three blocks of order n 4, is contained in ever...
AbstractA block of a path in a digraph is a maximal directed subpath. We prove that any n-chromatic ...
AbstractWe show that every oriented path of order n⩾4 with two blocks is contained in every n-chroma...
International audienceWe show that every oriented path of order n>=4 with two blocks is contained in...
We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromat...
In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first trea...
International audienceLet $f(k)$ be the smallest integer such that every $f(k)$-chromatic digraph co...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractThe purpose of this communication is to announce some sufficient conditions on degrees and n...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
AbstractIn [2] Berge asked: In a digraph, does there exist an optimal coloring and a path meeting ea...
AbstractSay a digraph is k-free if it has no directed cycles of length at most k, for k∈Z+. Thomassé...
AbstractIn this paper it is proved that the path number of the complete symmetric bipartite digraph ...
AbstractWe consider the so-called Path Partition Conjecture for digraphs which states that for every...
International audienceA (k1 + k2)-bispindle is the union of k1 (x, y)-dipaths and k2 (y, x)-dipaths,...
In this paper, we show that every oriented path with three blocks of order n 4, is contained in ever...
DOI
Add to ORKG