Geodesic
Uniform colorings of graphs
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part V, Tome 406 (2012), pp. 5-11

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

Let uniform proper coloring of a graph be a proper coloring in which all colors have equal numbers of vertices. We prove new conditions of existence of uniform colorings. 
@article{ZNSL_2012_406_a0,
     author = {S. L. Berlov},
     title = {Uniform colorings of graphs},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {5--11},
     publisher = {mathdoc},
     volume = {406},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2012_406_a0/}
}
TY  - JOUR
AU  - S. L. Berlov
TI  - Uniform colorings of graphs
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2012
SP  - 5
EP  - 11
VL  - 406
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2012_406_a0/
LA  - ru
ID  - ZNSL_2012_406_a0
ER  - 
%0 Journal Article
%A S. L. Berlov
%T Uniform colorings of graphs
%J Zapiski Nauchnykh Seminarov POMI
%D 2012
%P 5-11
%V 406
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2012_406_a0/
%G ru
%F ZNSL_2012_406_a0
S. L. Berlov. Uniform colorings of graphs. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part V, Tome 406 (2012), pp. 5-11. http://geodesic.mathdoc.fr/item/ZNSL_2012_406_a0/