Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MO_2014_72_4_a3, author = {A. Yu. Evnin}, title = {Chromatic polynomial of a graph in problems}, journal = {Matemati\v{c}eskoe obrazovanie}, pages = {9--15}, publisher = {mathdoc}, volume = {72}, number = {4}, year = {2014}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MO_2014_72_4_a3/} }
A. Yu. Evnin. Chromatic polynomial of a graph in problems. Matematičeskoe obrazovanie, Tome 72 (2014) no. 4, pp. 9-15. http://geodesic.mathdoc.fr/item/MO_2014_72_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. <ext-link ext-link-type='mr-item-id' href='http://mathscinet.ams.org/mathscinet-getitem?mr=2159409'>2159409</ext-link><ext-link ext-link-type='zbl-item-id' href='https://zbmath.org/?q=an:1070.05038'>1070.05038</ext-link>