International audienceWe show that every oriented path of order n>=4 with two blocks is contained in every n-chromatic digraph
The dichromatic number of a digraph D is the minimum number of colors needed to color its vertices i...
International audienceA (k 1 + k 2)-bispindle is the union of k 1 (x, y)-dipaths and k 2 (y, x)-dipa...
International audienceA (k1 + k2)-bispindle is the union of k1 (x, y)-dipaths and k2 (y, x)-dipaths,...
We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromat...
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...
In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first trea...
AbstractA block of a path in a digraph is a maximal directed subpath. We prove that any n-chromatic ...
International audienceLet $f(k)$ be the smallest integer such that every $f(k)$-chromatic digraph co...
In this paper, we show that every oriented path with three blocks of order n 4, is contained in ever...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
Let f (k) be the smallest integer such that every f (k)-chromatic digraph contains every oriented tr...
We consider the problem of finding two disjoint directed paths with prescribed ends in an acylic dig...
AbstractSay a digraph is k-free if it has no directed cycles of length at most k, for k∈Z+. Thomassé...
An {\it oriented cycle} is an orientation of a undirected cycle.We first show that for any oriented ...
The dichromatic number of a digraph D is the minimum number of colors needed to color its vertices i...
International audienceA (k 1 + k 2)-bispindle is the union of k 1 (x, y)-dipaths and k 2 (y, x)-dipa...
International audienceA (k1 + k2)-bispindle is the union of k1 (x, y)-dipaths and k2 (y, x)-dipaths,...
We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromat...
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...
In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first trea...
AbstractA block of a path in a digraph is a maximal directed subpath. We prove that any n-chromatic ...
International audienceLet $f(k)$ be the smallest integer such that every $f(k)$-chromatic digraph co...
In this paper, we show that every oriented path with three blocks of order n 4, is contained in ever...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
Let f (k) be the smallest integer such that every f (k)-chromatic digraph contains every oriented tr...
We consider the problem of finding two disjoint directed paths with prescribed ends in an acylic dig...
AbstractSay a digraph is k-free if it has no directed cycles of length at most k, for k∈Z+. Thomassé...
An {\it oriented cycle} is an orientation of a undirected cycle.We first show that for any oriented ...
The dichromatic number of a digraph D is the minimum number of colors needed to color its vertices i...
International audienceA (k 1 + k 2)-bispindle is the union of k 1 (x, y)-dipaths and k 2 (y, x)-dipa...
International audienceA (k1 + k2)-bispindle is the union of k1 (x, y)-dipaths and k2 (y, x)-dipaths,...
DOI
Add to ORKG