Geodesic
Half-chromatic number of graph
Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 1, pp. 3-11 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

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},
     year = {2013},
     volume = {20},
     number = {1},
     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
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
%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/

[1] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982, 416 pp. | MR

[2] Evstigneev V. A., Kasyanov V. N., Tolkovyi slovar po teorii grafov v informatike i programmirovanii, Nauka, Novosibirsk, 1999, 288 pp. | Zbl

[3] Zykov A. A., Osnovy teorii grafov, Vuzovskaya kniga, M., 2004, 663 pp.

[4] Jensen T. R., Toft B., Graph coloring problems, John Wiley Sons, New York, 1995, 296 pp. | MR | Zbl

[5] Robertson N., Sanders D., Seymour P. D., Thomas R., “The four-colour theorem”, J. Comb. Theory. Ser. B, 70 (1997), 2–44 | DOI | MR | Zbl