On properties of minimal extensions of orgraphs
Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 84-85
Some properties of minimal vertex extensions of directed graphs are studied, and analysis of the results of computational experiment on the construction of minimal vertex 1-extensions of oriented graphs with the number of vertices up to 6 is given.
@article{PDM_2011_13_a42,
author = {M. B. Abrosimov and O. V. Modenova},
title = {On properties of minimal extensions of orgraphs},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {84--85},
year = {2011},
number = {13},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2011_13_a42/}
}
M. B. Abrosimov; O. V. Modenova. On properties of minimal extensions of orgraphs. Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 84-85. http://geodesic.mathdoc.fr/item/PDM_2011_13_a42/
[1] Abrosimov M. B., Dolgov A. A., “Tochnye rasshireniya nekotorykh turnirov”, Vestnik Tomskogo gosuniversiteta, 2007, Prilozhenie No 23, 211–216