|
Zapiski Nauchnykh Seminarov POMI, 2012, Volume 406, Pages 5–11
(Mi znsl5287)
|
|
|
|
Uniform colorings of graphs
S. L. Berlovab a Physical and Mathematical Lyceum 239, St. Petersburg, Russia
b P. G. Demidov Yaroslavl State University, Yaroslavl, Russia
Abstract:
Let uniform proper coloring of a graph be a proper coloring in which all colors have equal numbers of vertices. We prove new conditions of existence of uniform colorings.
Key words and phrases:
chromatic number, clique, critical subgraph.
Received: 31.10.2012
Citation:
S. L. Berlov, “Uniform colorings of graphs”, Combinatorics and graph theory. Part V, Zap. Nauchn. Sem. POMI, 406, POMI, St. Petersburg, 2012, 5–11; J. Math. Sci. (N. Y.), 196:6 (2014), 733–736
Linking options:
https://www.mathnet.ru/eng/znsl5287 https://www.mathnet.ru/eng/znsl/v406/p5
|
Statistics & downloads: |
Abstract page: | 226 | Full-text PDF : | 79 | References: | 67 |
|