DOIAbstract
AbstractWe show that there exist digraphs D such that for all paths P1 and P2 we have α(D(P1∪P2)) = α(D) and point to a generalization
AbstractWe show that there exist digraphs D such that for all paths P1 and P2 we have α(D(P1∪P2)) = α(D) and point to a generalization
AbstractIt is shown that in a digraph G, there is an elementary directed path or an elementary direc...
For a set D of positive integers, we define a vertex set S ⊆ V(G) to be D-independent if u, v ∈ S im...
AbstractWe consider the so-called Path Partition Conjecture for digraphs which states that for every...
AbstractWe show that there exist digraphs D such that for all paths P1 and P2 we have α(D(P1∪P2)) = ...
AbstractA digraph D verifies the Chvátal–Erdős conditions if α(D)⩽κ(D), where α(D) is the stability ...
In 1982 Laborde, Payan and Xuong [Independent sets and longest directed paths in digraphs, in: Graph...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
A digraph H is infused in a digraph G if the vertices of H are mapped to vertices of G (not necessar...
AbstractSay a digraph is k-free if it has no directed cycles of length at most k, for k∈Z+. Thomassé...
AbstractWe let D denote a digraph with n vertices, independence number at least α and half-degrees a...
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path wit...
AbstractLinial conjectured that Greene—Kleitman's theorem can be extended to general digraphs. We pr...
AbstractIn this paper, we consider the paths, cycles and circular colorings of digraphs. Let D be a ...
We investigate sufficient conditions, and in case that D be an asymmetrical digraph a necessary and ...
AbstractIt is shown that in a digraph G, there is an elementary directed path or an elementary direc...
For a set D of positive integers, we define a vertex set S ⊆ V(G) to be D-independent if u, v ∈ S im...
AbstractWe consider the so-called Path Partition Conjecture for digraphs which states that for every...
AbstractWe show that there exist digraphs D such that for all paths P1 and P2 we have α(D(P1∪P2)) = ...
AbstractA digraph D verifies the Chvátal–Erdős conditions if α(D)⩽κ(D), where α(D) is the stability ...
In 1982 Laborde, Payan and Xuong [Independent sets and longest directed paths in digraphs, in: Graph...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
The concept of a line digraph is generalized to that of a directed path graph. The directed path gra...
A digraph H is infused in a digraph G if the vertices of H are mapped to vertices of G (not necessar...
AbstractSay a digraph is k-free if it has no directed cycles of length at most k, for k∈Z+. Thomassé...
AbstractWe let D denote a digraph with n vertices, independence number at least α and half-degrees a...
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path wit...
AbstractLinial conjectured that Greene—Kleitman's theorem can be extended to general digraphs. We pr...
AbstractIn this paper, we consider the paths, cycles and circular colorings of digraphs. Let D be a ...
We investigate sufficient conditions, and in case that D be an asymmetrical digraph a necessary and ...
AbstractIt is shown that in a digraph G, there is an elementary directed path or an elementary direc...
For a set D of positive integers, we define a vertex set S ⊆ V(G) to be D-independent if u, v ∈ S im...
AbstractWe consider the so-called Path Partition Conjecture for digraphs which states that for every...
Add to ORKG