Abstract:
Algorithms constructing T-irreducible extensions (TIE) for unions of paths, for the union of an oriented graph and its TIE, and for directed stars are proposed.
Keywords:T-irreducible extension, TIE, minimal T-irreducible extension, union of some types digraphs, union of paths, TIE for directed stars.