Add to ORKGIn this paper, we show that every oriented path with three blocks of order n 4, is contained in every digraph with chromatic number at least 4.6n
AbstractIn this paper it is proved that if the chromatic polynomial P(G; λ) is maximum for λ = 3 in ...
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed...
AbstractWe call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A ...
International audienceWe show that every oriented path of order n>=4 with two blocks is contained in...
AbstractWe show that every oriented path of order n⩾4 with two blocks is contained in every n-chroma...
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 ...
We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromat...
International audienceLet $f(k)$ be the smallest integer such that every $f(k)$-chromatic digraph co...
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed...
A famous conjecture of Gyárfás and Sumner states for any tree T and integer k, if the chromatic numb...
AbstractIn this paper, we consider the paths, cycles and circular colorings of digraphs. Let D be a ...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceA famous conjecture of Gyárfás and Sumner states for any tree T and integer k,...
AbstractIn this paper it is proved that if the chromatic polynomial P(G; λ) is maximum for λ = 3 in ...
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed...
AbstractWe call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A ...
International audienceWe show that every oriented path of order n>=4 with two blocks is contained in...
AbstractWe show that every oriented path of order n⩾4 with two blocks is contained in every n-chroma...
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 ...
We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromat...
International audienceLet $f(k)$ be the smallest integer such that every $f(k)$-chromatic digraph co...
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed...
A famous conjecture of Gyárfás and Sumner states for any tree T and integer k, if the chromatic numb...
AbstractIn this paper, we consider the paths, cycles and circular colorings of digraphs. Let D be a ...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceA famous conjecture of Gyárfás and Sumner states for any tree T and integer k,...
AbstractIn this paper it is proved that if the chromatic polynomial P(G; λ) is maximum for λ = 3 in ...
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed...
AbstractWe call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A ...