A family of exact 2-extensions of tournaments
Prikladnaâ diskretnaâ matematika, no. 3 (2010), pp. 96-99
Voir la notice de l'article provenant de la source Math-Net.Ru
The family of tournaments which have exact 1- and 2-extensions but haven't exact 3-extension is introduced. It is the only known family of graphs with such a property, and it is the fourth family of graphs which have exact $k$-extension for $k>1$.
Keywords:
graph, exact $k$-extension
Mots-clés : circulant.
Mots-clés : circulant.
@article{PDM_2010_3_a8,
author = {A. A. Dolgov},
title = {A family of exact 2-extensions of tournaments},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {96--99},
publisher = {mathdoc},
number = {3},
year = {2010},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2010_3_a8/}
}
A. A. Dolgov. A family of exact 2-extensions of tournaments. Prikladnaâ diskretnaâ matematika, no. 3 (2010), pp. 96-99. http://geodesic.mathdoc.fr/item/PDM_2010_3_a8/