Restrictions on girths in compact graphs
Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 96-98
Voir la notice de l'article provenant de la source Math-Net.Ru
By definition, the compact graph is a regular graph with the minimum diameter. In the paper, the compactness conditions are investigated for regular graphs with the length of a minimum cycle restricted.
@article{PDM_2011_13_a49,
author = {V. A. Melent'ev},
title = {Restrictions on girths in compact graphs},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {96--98},
publisher = {mathdoc},
number = {13},
year = {2011},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2011_13_a49/}
}
V. A. Melent'ev. Restrictions on girths in compact graphs. Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 96-98. http://geodesic.mathdoc.fr/item/PDM_2011_13_a49/