Geodesic
T-irreducible extension of unions of some types orgraphs
Prikladnaâ diskretnaâ matematika, no. 4 (2013), pp. 47-55.

Voir la notice de l'article provenant de la source Math-Net.Ru

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, minimal T-irreducible extension, union of some types digraphs, union of paths, TIE for directed stars.
Mots-clés : TIE 
@article{PDM_2013_4_a4,
     author = {A. V. Gavrikov},
     title = {T-irreducible extension of unions of some types orgraphs},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {47--55},
     publisher = {mathdoc},
     number = {4},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2013_4_a4/}
}
TY  - JOUR
AU  - A. V. Gavrikov
TI  - T-irreducible extension of unions of some types orgraphs
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2013
SP  - 47
EP  - 55
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2013_4_a4/
LA  - ru
ID  - PDM_2013_4_a4
ER  - 
%0 Journal Article
%A A. V. Gavrikov
%T T-irreducible extension of unions of some types orgraphs
%J Prikladnaâ diskretnaâ matematika
%D 2013
%P 47-55
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2013_4_a4/
%G ru
%F PDM_2013_4_a4
A. V. Gavrikov. T-irreducible extension of unions of some types orgraphs. Prikladnaâ diskretnaâ matematika, no. 4 (2013), pp. 47-55. http://geodesic.mathdoc.fr/item/PDM_2013_4_a4/

[1] Bogomolov A. M., Salii V. N., Algebraicheskie osnovy teorii diskretnykh sistem, Nauka, Fizmatlit, M., 1997, 368 pp. | MR | Zbl

[2] Kurnosova S. G., “T-neprivodimye rasshireniya dlya nekotorykh klassov grafov”, Teoreticheskie problemy informatiki i eë prilozhenii, Cb. nauch. tr., ed. prof. A. A. Sytnik, Izd-vo Sarat. un-ta, Saratov, 2004, 113–125

[3] Salii V. N., “Dokazatelstva s nulevym razglasheniem v zadachakh o rasshirenii grafov”, Vestnik Tomskogo gosudarstvennogo universiteta. Prilozhenie, 2003, no. 6, 63–65

[4] Abrosimov M. B., “O slozhnosti nekotorykh zadach, svyazannykh s rasshireniyami grafov”, Matem. zametki, 88:5 (2010), 643–650 | DOI | MR | Zbl

[5] Kurnosova S. G., “T-neprivodimoe rasshirenie dlya simmetrichnykh orientatsii tsepei”, Teoreticheskie problemy informatiki i ee prilozhenii, Cb. nauch. tr., ed. prof. A. A. Sytnik, Izd-vo Sarat. un-ta, Saratov, 2006, 76–81