Geodesic
Chromatic polynomial of a graph in problems
Matematičeskoe obrazovanie, no. 4 (2014), pp. 9-15 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Some properties of chromatic polynomial of a graph are presented as a set of problems.
Keywords: graf, correct coloring of the graph, the chromatic polynomial of a graph. 
@article{MO_2014_4_a3,
     author = {A. Yu. Evnin},
     title = {Chromatic polynomial of a graph in problems},
     journal = {Matemati\v{c}eskoe obrazovanie},
     pages = {9--15},
     year = {2014},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MO_2014_4_a3/}
}
TY  - JOUR
AU  - A. Yu. Evnin
TI  - Chromatic polynomial of a graph in problems
JO  - Matematičeskoe obrazovanie
PY  - 2014
SP  - 9
EP  - 15
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MO_2014_4_a3/
LA  - ru
ID  - MO_2014_4_a3
ER  - 
%0 Journal Article
%A A. Yu. Evnin
%T Chromatic polynomial of a graph in problems
%J Matematičeskoe obrazovanie
%D 2014
%P 9-15
%N 4
%U http://geodesic.mathdoc.fr/item/MO_2014_4_a3/
%G ru
%F MO_2014_4_a3
A. Yu. Evnin. Chromatic polynomial of a graph in problems. Matematičeskoe obrazovanie, no. 4 (2014), pp. 9-15. http://geodesic.mathdoc.fr/item/MO_2014_4_a3/

[1] M. L. Krasnov, A. I. Kiselëv, G. I. Makarenko i dr., Vsya vysshaya matematika, uchebnik, v. 7, KomKniga, M., 2014, 208 pp.

[2] A. Yu. Evnin, Zadachnik po diskretnoi matematike, LIBROKOM, M., 2014, 264 pp.

[3] M. O. Asanov, V. A. Baranskii, V. V. Rasin, Diskretnaya matematika: grafy, matroidy, algoritmy, Uch. posobie, 2, Izd-vo «Lan», SPb, 2010, 368 pp.

[4] S. K. Lando, Vvedenie v diskretnuyu matematiku, MTsNMO, M., 2012, 265 pp.

[5] L. Lovasz, Combinatorial Problems and Exersizes, American Mathematical Society, 2007, 639 pp.

[6] F. M. Dong, K. M. Koh, K. L. Teo, Chromatic Polynomials and Chromaticity of Graphs, World Scientific Publishing Co. Pte. Ltd., 2005, 380 pp. | MR | Zbl