Geodesic
Half-chromatic number of graph
Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 1, pp. 3-11

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

The notion of a half-chromatic number is introduced for graphs with a non-empty set of edges. It is proved that the difference between the half-chromatic number and a half of the chromatic number is at most 1. Bibliogr. 5.
Keywords: chromatic number, half-chromatic number, injective coloring. 
@article{DA_2013_20_1_a0,
     author = {V. G. Vizing},
     title = {Half-chromatic number of graph},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--11},
     publisher = {mathdoc},
     volume = {20},
     number = {1},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2013_20_1_a0/}
}
TY  - JOUR
AU  - V. G. Vizing
TI  - Half-chromatic number of graph
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2013
SP  - 3
EP  - 11
VL  - 20
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2013_20_1_a0/
LA  - ru
ID  - DA_2013_20_1_a0
ER  - 
%0 Journal Article
%A V. G. Vizing
%T Half-chromatic number of graph
%J Diskretnyj analiz i issledovanie operacij
%D 2013
%P 3-11
%V 20
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2013_20_1_a0/
%G ru
%F DA_2013_20_1_a0
V. G. Vizing. Half-chromatic number of graph. Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 1, pp. 3-11. http://geodesic.mathdoc.fr/item/DA_2013_20_1_a0/