AbstractLaborde, Payan and Xuong conjectured that every digraph has a stable set meeting every longest path. We prove that this conjecture holds for digraphs with stability number at most 2
AbstractThe Gallai–Milgram theorem states that every directed graph D is spanned by α(D) disjoint di...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
AbstractLaborde, Payan and Xuong conjectured that every digraph has a stable set meeting every longe...
AbstractGallai and Milgram (1960) proved that a digraph with stability number α is spanned by α disj...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
We prove some sufficient conditions for a directed graph to have the property of a conjecture of J.M...
Laborde, Payan and Xuong [1] conjectured that every digraph has an indepen-dent set of vertices that...
AbstractIn [2] Berge asked: In a digraph, does there exist an optimal coloring and a path meeting ea...
AbstractWe prove some sufficient conditions for a directed graph to have the property of a conjectur...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
We present several results concerning the Laborde-Payan-Xuang conjecture stating that in every digra...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
A digraph obtained by replacing each edge of a complete $m$-partite graph with an arc or a pair of m...
We consider digraphs -- called extended locally semicomplete digraphs, or extended LSD's, for s...
AbstractThe Gallai–Milgram theorem states that every directed graph D is spanned by α(D) disjoint di...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
AbstractLaborde, Payan and Xuong conjectured that every digraph has a stable set meeting every longe...
AbstractGallai and Milgram (1960) proved that a digraph with stability number α is spanned by α disj...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
We prove some sufficient conditions for a directed graph to have the property of a conjecture of J.M...
Laborde, Payan and Xuong [1] conjectured that every digraph has an indepen-dent set of vertices that...
AbstractIn [2] Berge asked: In a digraph, does there exist an optimal coloring and a path meeting ea...
AbstractWe prove some sufficient conditions for a directed graph to have the property of a conjectur...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
We present several results concerning the Laborde-Payan-Xuang conjecture stating that in every digra...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
A digraph obtained by replacing each edge of a complete $m$-partite graph with an arc or a pair of m...
We consider digraphs -- called extended locally semicomplete digraphs, or extended LSD's, for s...
AbstractThe Gallai–Milgram theorem states that every directed graph D is spanned by α(D) disjoint di...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
DOI
Add to ORKG