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
Let D be a digraph. V(D) denotes the set of vertices of D; a set N ⊆ V(D) is said to be a k-kernel o...
AbstractLet G be a directed graph whose edges are coloured with two colours. Call a set S of vertice...
International audienceIn 1985, Mader conjectured the existence of a function f such that every digra...
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...
In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first trea...
We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromat...
In this paper, we show that every oriented path with three blocks of order n 4, is contained in ever...
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A subdigra...
An m-colored digraph is a digraph whose arcs are colored with m colors. A directed path is monochrom...
We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. A directed path...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours and all of ...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
Let D be a digraph. V(D) denotes the set of vertices of D; a set N ⊆ V(D) is said to be a k-kernel o...
AbstractLet G be a directed graph whose edges are coloured with two colours. Call a set S of vertice...
International audienceIn 1985, Mader conjectured the existence of a function f such that every digra...
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...
In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first trea...
We show that every oriented path of order $n\geq4$ with two blocks is contained in every $n$-chromat...
In this paper, we show that every oriented path with three blocks of order n 4, is contained in ever...
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A subdigra...
An m-colored digraph is a digraph whose arcs are colored with m colors. A directed path is monochrom...
We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. A directed path...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours and all of ...
In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-de...
Let D be a digraph. V(D) denotes the set of vertices of D; a set N ⊆ V(D) is said to be a k-kernel o...
AbstractLet G be a directed graph whose edges are coloured with two colours. Call a set S of vertice...
International audienceIn 1985, Mader conjectured the existence of a function f such that every digra...
DOI
Add to ORKG