|
Diskretnyi Analiz i Issledovanie Operatsii, 2013, Volume 20, Issue 1, Pages 3–11
(Mi da714)
|
|
|
|
Half-chromatic number of graph
V. G. Vizing Odessa, Ukraine
Abstract:
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.
Received: 31.07.2012
Citation:
V. G. Vizing, “Half-chromatic number of graph”, Diskretn. Anal. Issled. Oper., 20:1 (2013), 3–11; J. Appl. Industr. Math., 7:2 (2013), 269–274
Linking options:
https://www.mathnet.ru/eng/da714 https://www.mathnet.ru/eng/da/v20/i1/p3
|
Statistics & downloads: |
Abstract page: | 320 | Full-text PDF : | 142 | References: | 45 | First page: | 9 |
|