On the Chromatic Number of Graphs with Some Restriction of Vertex Degrees

被引：0

作者：

Selezneva, S. N. ^{[1
]}

机构：

[1] Lomonosov Moscow State Univ, Moscow 119991, Russia

来源：

UCHENYE ZAPISKI KAZANSKOGO UNIVERSITETA-SERIYA FIZIKO-MATEMATICHESKIE NAUKI | 2020年 / 162卷 / 04期

关键词：

graph; coloring; vertex coloring; chromatic number; degree of vertex in graph;

D O I：

10.26907/2541-7746.2020.4.387-395

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 >= 3, were considered. Properties were obtained to color vertices of these graphs in d colors.

引用

页码：387 / 395

页数：9

共 7 条

[1] Bondy J.A., 2008, GTM
[2] Emelichev V. A., 2009, LEKTSII TEORII GRAFO
[3] Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1
[4] Malyshev D., 2020, ZH SREDNEVOLZHSKOGO, V22, P38, DOI [10.15507/2079-6900.22.202001.38-47, DOI 10.15507/2079-6900.22.202001.38-47]
[5] Coloring of Pseudocubic Graphs in Three Colors
S. N. Selezneva
M. V. Mel’nik
A. V. Astakhova
[J]. Moscow University Computational Mathematics and Cybernetics, 2019, 43 (2) : 82 - 88
[6] Stockmeyer Larry, 1973, SIGACT News, V5, P19
[7] Vizing, 1976, METODY DISKRET ANAL, V29, P3

← 1 →