We investigate expressions of form A×C ≅ B×C involving direct products of digraphs. Lovász gave exact conditions on C for which it necessarily follows that A ≅ B. We are here concerned with a different aspect of cancellation. We describe exact conditions on A for which it necessarily follows that A ≅ B. In the process, we do the following: Given an arbitrary digraph A and a digraph C that admits a homomorphism onto an arc, we classify all digraphs B for which A×C ≅ B×C
AbstractWe describe an infinite class of digraphs with the property that the reversal of any arc inc...
AbstractThe existence of a homomorphism between two digraphs often implies many structural propertie...
This thesis generalizes to digraphs certain recent results about graphs. There are special digraphs ...
Given graphs A, B and C for which A×C ≅ B×C, it is not generally true that A ≅ B. However, it is kno...
AbstractThe direct product of graphs obeys a limited cancellation property. Lovász proved that if C ...
This paper discusses the direct product cancellation of digraphs. We define the exact conditions on ...
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative pro...
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
A digraph is nonderogatory if its characteristic polynomial and minimal polynomial are equal. We fin...
Abstract. We introduce a construction of highly arc transitive digraphs using a layerwise direct pro...
AbstractWe are motivated by the following question concerning the direct product of graphs. If A×C≅B...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
AbstractIn this note we consider closed walks, which are cycles that are not necessarily elementary....
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v...
AbstractWe describe an infinite class of digraphs with the property that the reversal of any arc inc...
AbstractThe existence of a homomorphism between two digraphs often implies many structural propertie...
This thesis generalizes to digraphs certain recent results about graphs. There are special digraphs ...
Given graphs A, B and C for which A×C ≅ B×C, it is not generally true that A ≅ B. However, it is kno...
AbstractThe direct product of graphs obeys a limited cancellation property. Lovász proved that if C ...
This paper discusses the direct product cancellation of digraphs. We define the exact conditions on ...
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative pro...
AbstractGiven a digraph G and a sufficiently long directed path P, a folklore result says that G is ...
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographi...
A digraph is nonderogatory if its characteristic polynomial and minimal polynomial are equal. We fin...
Abstract. We introduce a construction of highly arc transitive digraphs using a layerwise direct pro...
AbstractWe are motivated by the following question concerning the direct product of graphs. If A×C≅B...
For digraphs D and H, a mapping f:V(D)→V(H) is a homomorphism of D to H if uvA(D) implies f(u)f(v)A(...
AbstractIn this note we consider closed walks, which are cycles that are not necessarily elementary....
If D = (V, A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v...
AbstractWe describe an infinite class of digraphs with the property that the reversal of any arc inc...
AbstractThe existence of a homomorphism between two digraphs often implies many structural propertie...
This thesis generalizes to digraphs certain recent results about graphs. There are special digraphs ...