DOIAbstract
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
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
AbstractGallai and Milgram (1960) proved that a digraph with stability number α is spanned by α disj...
AbstractLinial conjectured that Greene—Kleitman's theorem can be extended to general digraphs. We pr...
AbstractThe stability number α(G) of a graph G is the size of a maximum stable set of G, core(G)=⋂{S...
AbstractLaborde, Payan and Xuong conjectured that every digraph has a stable set meeting every longe...
Laborde, Payan and Xuong [1] conjectured that every digraph has an indepen-dent set of vertices that...
We prove some sufficient conditions for a directed graph to have the property of a conjecture of J.M...
We present several results concerning the Laborde-Payan-Xuang conjecture stating that in every digra...
AbstractWe prove some sufficient conditions for a directed graph to have the property of a conjectur...
AbstractWe consider the so-called Path Partition Conjecture for digraphs which states that for every...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
We introduce the notion of sink-stable sets of a digraph and prove a min-max formula for the maximum...
AbstractThe Path Partition Conjecture for digraphs states that for every digraph D, and every choice...
In the context of finding the largest stable set of a graph, rank inequalities prescribe that a stab...
In 1982 Laborde, Payan and Xuong [Independent sets and longest directed paths in digraphs, in: Graph...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractGallai and Milgram (1960) proved that a digraph with stability number α is spanned by α disj...
AbstractLinial conjectured that Greene—Kleitman's theorem can be extended to general digraphs. We pr...
AbstractThe stability number α(G) of a graph G is the size of a maximum stable set of G, core(G)=⋂{S...
AbstractLaborde, Payan and Xuong conjectured that every digraph has a stable set meeting every longe...
Laborde, Payan and Xuong [1] conjectured that every digraph has an indepen-dent set of vertices that...
We prove some sufficient conditions for a directed graph to have the property of a conjecture of J.M...
We present several results concerning the Laborde-Payan-Xuang conjecture stating that in every digra...
AbstractWe prove some sufficient conditions for a directed graph to have the property of a conjectur...
AbstractWe consider the so-called Path Partition Conjecture for digraphs which states that for every...
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs t...
We introduce the notion of sink-stable sets of a digraph and prove a min-max formula for the maximum...
AbstractThe Path Partition Conjecture for digraphs states that for every digraph D, and every choice...
In the context of finding the largest stable set of a graph, rank inequalities prescribe that a stab...
In 1982 Laborde, Payan and Xuong [Independent sets and longest directed paths in digraphs, in: Graph...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractGallai and Milgram (1960) proved that a digraph with stability number α is spanned by α disj...
AbstractLinial conjectured that Greene—Kleitman's theorem can be extended to general digraphs. We pr...
AbstractThe stability number α(G) of a graph G is the size of a maximum stable set of G, core(G)=⋂{S...
Add to ORKG