Edge-regular graphs in which every vertex lies in at most one good pair
Vladikavkazskij matematičeskij žurnal, Tome 10 (2008) no. 1, pp. 53-67
Voir la notice de l'article provenant de la source Math-Net.Ru
@article{VMJ_2008_10_1_a7,
author = {A. A. Makhnev and N. V. Chuksina},
title = {Edge-regular graphs in which every vertex lies in at most one good pair},
journal = {Vladikavkazskij matemati\v{c}eskij \v{z}urnal},
pages = {53--67},
publisher = {mathdoc},
volume = {10},
number = {1},
year = {2008},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMJ_2008_10_1_a7/}
}
TY - JOUR AU - A. A. Makhnev AU - N. V. Chuksina TI - Edge-regular graphs in which every vertex lies in at most one good pair JO - Vladikavkazskij matematičeskij žurnal PY - 2008 SP - 53 EP - 67 VL - 10 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VMJ_2008_10_1_a7/ LA - ru ID - VMJ_2008_10_1_a7 ER -
A. A. Makhnev; N. V. Chuksina. Edge-regular graphs in which every vertex lies in at most one good pair. Vladikavkazskij matematičeskij žurnal, Tome 10 (2008) no. 1, pp. 53-67. http://geodesic.mathdoc.fr/item/VMJ_2008_10_1_a7/