Coloring of Pseudocubic Graphs in Three Colors
A graph is called pseudocubic if the degrees of all its vertices, with a single exception, do not exceed three, and the degree of an exceptional vertex does not exceed four. In this work, it is proved that the vertices of a pseudocubic graph without induced subgraphs that are isomorphic to K4 or K 4 − can be colored in three colors. In addition, it is shown that the problem of 3-coloring of pseudocubic graphs can be solved using a polynomial algorithm.
Keywordsgraph cubic graph subcubic graph pseudocubic graph degree of vertex coloring of vertices chromatic number 3-coloring of graphs polynomial algorithm
Unable to display preview. Download preview PDF.
- 3.D. Konig, Theorie der endlichen und unendlichen Graphen (Leipzig, 1936).Google Scholar
- 7.F. Bonomo, M. Chudnovsky, P. Maceli, O. Schaudt, M. Stein, and M. Zhong, “Three-coloringand list three-coloring of graphs without induced paths on seven vertices,” Combinatorica, 1–23 (2017).Google Scholar
- 12.V. G. Vizing, “Coloring graph vertices in prescribed colors,” in Discrete Analysis Methods in the Theory of Codes and Schemes, Collection of Articles (Inst. Mat. SO AN SSSR, Novosibirsk, 1976), Vol. 29, pp. 3–10 [in Russian].Google Scholar