... d > 1, the digraph ∗ DG,M is of type T± and has properties 4− and 3+ Thus the (4− , 3+ )-entry of the table corresponding to the type T± is Y as well The proof of the assertion (1) of Theorem ... that the digraph DG,M is of type T± Since DG,M has properties 3− and 4+ (see the proof of Theorem 4.2), the (3− , 4+ )-entry of the table corresponding to the type T± is Y Furthermore, in the ... partitions of their vertex sets If D is digraph and τ a partition of V (D), then the vertex set of the quotient graph D/τ is given by the sets of τ , and, for vertices uτ and v τ of D/τ , (uτ...