Paths with two blocks in n-chromatic digraphs
- Thomassé, Stéphan
- Havet, Frédéric
- Addario-Berry, Louigi
DOIAbstract
International audienceWe show that every oriented path of order n>=4 with two blocks is contained in every n-chromatic digraph
International audienceWe show that every oriented path of order n>=4 with two blocks is contained in every n-chromatic digraph
The nth detour chromatic number, χₙ(G) of a graph G is the minimum number of colours required to col...
A famous conjecture of Gyárfás and Sumner states for any tree T and integer k, if the chromatic numb...
International audienceA famous conjecture of Gyárfás and Sumner states for any tree T and integer k,...
AbstractWe show that every oriented path of order n⩾4 with two blocks is contained in every n-chroma...
In this paper, we show that every oriented path with three blocks of order n 4, is contained in ever...
In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first trea...
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...
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...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
AbstractWe discuss the chromaticity of one family of K4-homeomorphs which has exactly 2 adjacent pat...
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 ...
The nth detour chromatic number, χₙ(G) of a graph G is the minimum number of colours required to col...
A famous conjecture of Gyárfás and Sumner states for any tree T and integer k, if the chromatic numb...
International audienceA famous conjecture of Gyárfás and Sumner states for any tree T and integer k,...
AbstractWe show that every oriented path of order n⩾4 with two blocks is contained in every n-chroma...
In this paper, we show that every oriented path with three blocks of order n 4, is contained in ever...
In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first trea...
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...
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...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
AbstractWe discuss the chromaticity of one family of K4-homeomorphs which has exactly 2 adjacent pat...
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 ...
The nth detour chromatic number, χₙ(G) of a graph G is the minimum number of colours required to col...
A famous conjecture of Gyárfás and Sumner states for any tree T and integer k, if the chromatic numb...
International audienceA famous conjecture of Gyárfás and Sumner states for any tree T and integer k,...
Add to ORKG