|
On the chromatic number of graphs with some restriction of vertex degrees
S. N. Selezneva Lomonosov Moscow State University, Moscow, 119991 Russia
Abstract:
Graphs, for which the degree of a certain vertex is equal to $(d+1)$ and the degrees of all other vertices are at most $d$, $d \geqslant 3$, were considered. Properties were obtained to color vertices of these graphs in $d$ colors.
Keywords:
graph, coloring, vertex coloring, chromatic number, degree of vertex in graph.
Received: 23.10.2020
Citation:
S. N. Selezneva, “On the chromatic number of graphs with some restriction of vertex degrees”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 162, no. 4, Kazan University, Kazan, 2020, 387–395
Linking options:
https://www.mathnet.ru/eng/uzku1569 https://www.mathnet.ru/eng/uzku/v162/i4/p387
|
Statistics & downloads: |
Abstract page: | 240 | Full-text PDF : | 139 | References: | 22 |
|