채색 다항식
참고자료

Biggs, N. (1993), 《Algebraic Graph Theory》, Cambridge University Press, ISBN 978-0-521-45897-9
Chao, C.-Y.; Whitehead, E. G. (1978), 〈On chromatic equivalence of graphs〉, 《Theory and Applications of Graphs》, Lecture Notes in Mathematics 642, Springer, 121–131쪽, ISBN 978-3-540-08666-6
Dong, F. M.; Koh, K. M.; Teo, K. L. (2005), 《Chromatic polynomials and chromaticity of graphs》, World Scientific Publishing Company, ISBN 978-981-256-317-0
Ellis-Monaghan, Joanna A.; Merino, Criel (2011), 〈Graph polynomials and their applications I: The Tutte polynomial〉,   Dehmer, Matthias, 《Structural Analysis of Complex Networks》 (영국 영어), arXiv:0803.3079, doi:10.1007/978-0-8176-4789-6_9, ISBN 978-0-8176-4789-6, S2CID 585250
Giménez, O.; Hliněný, P.; Noy, M. (2005), 〈Computing the Tutte polynomial on graphs of bounded clique-width〉, 《Proc. 31st Int. Worksh. Graph-Theoretic Concepts in Computer Science (WG 2005)》, Lecture Notes in Computer Science 3787, Springer-Verlag, 59–68쪽, CiteSeerX 10.1.1.353.6385, doi:10.1007/11604686_6, ISBN 978-3-540-31000-6
Goldberg, L.A.; Jerrum, M. (2008), “Inapproximability of the Tutte polynomial”, 《Information and Computation》 206 (7): 908, arXiv:cs/0605140, doi:10.1016/j.ic.2008.04.003, S2CID 53304001
Helme-Guizon, Laure; Rong, Yongwu (2005), “A categorification of the chromatic polynomial”, 《Algebraic & Geometric Topology》 5 (4): 1365–1388, arXiv:math/0412264, doi:10.2140/agt.2005.5.1365, S2CID 1339633
Huh, June (2012), “Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs”, 《Journal of the American Mathematical Society》 25 (3): 907–927, arXiv:1008.4749, doi:10.1090/S0894-0347-2012-00731-0, MR 2904577, S2CID 13523955
Jackson, B. (1993), “A Zero-Free Interval for Chromatic Polynomials of Graphs”, 《Combinatorics, Probability and Computing》 2 (3): 325–336, doi:10.1017/S0963548300000705, S2CID 39978844
Jaeger, F.; Vertigan, D. L.; Welsh, D. J. A. (1990), “On the computational complexity of the Jones and Tutte polynomials”, 《Mathematical Proceedings of the Cambridge Philosophical Society》 108 (1): 35–53, Bibcode:1990MPCPS.108...35J, doi:10.1017/S0305004100068936, S2CID 121454726
Linial, N. (1986), “Hard enumeration problems in geometry and combinatorics”, 《SIAM J. Algebr. Discrete Methods》 7 (2): 331–335, doi:10.1137/0607036
Makowsky, J. A.; Rotics, U.; Averbouch, I.; Godlin, B. (2006), 〈Computing graph polynomials on graphs of bounded clique-width〉, 《Proc. 32nd Int. Worksh. Graph-Theoretic Concepts in Computer Science (WG 2006)》, Lecture Notes in Computer Science 4271, Springer-Verlag, 191–204쪽, CiteSeerX 10.1.1.76.2320, doi:10.1007/11917496_18, ISBN 978-3-540-48381-6
Naor, J.; Naor, M.; Schaffer, A. (1987), 〈Fast parallel algorithms for chordal graphs〉, 《Proc. 19th ACM Symp. Theory of Computing (STOC '87)》, 355–364쪽, doi:10.1145/28395.28433, ISBN 978-0897912211, S2CID 12132229 .
Oxley, J. G.; Welsh, D. J. A. (2002), “Chromatic, flow and reliability polynomials: The complexity of their coefficients.”, 《Combinatorics, Probability and Computing》 11 (4): 403–426, doi:10.1017/S0963548302005175, S2CID 14918970
Pemmaraju, S.; Skiena, S. (2003), 《Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica》, Cambridge University Press, section 7.4.2, ISBN 978-0-521-80686-2
Read, R. C. (1968), “An introduction to chromatic polynomials” (PDF), 《Journal of Combinatorial Theory》 4: 52–71, doi:10.1016/S0021-9800(68)80087-0
Sekine, Kyoko; Imai, Hiroshi; Tani, Seiichiro (1995), 〈Computing the Tutte polynomial of a graph of moderate size〉,   Staples, John; Eades, Peter; Katoh, Naoki; Moffat, Alistair, 《Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4–6, 1995, Proceedings》, Lecture Notes in Computer Science 1004, Springer, 224–233쪽, doi:10.1007/BFb0015427, ISBN 978-3-540-60573-7
Sokal, A. D. (2004), “Chromatic Roots are Dense in the Whole Complex Plane”, 《Combinatorics, Probability and Computing》 13 (2): 221–261, arXiv:cond-mat/0012369, doi:10.1017/S0963548303006023, S2CID 5549332
Stanley, R. P. (1973), “Acyclic orientations of graphs” (PDF), 《Discrete Math.》 5 (2): 171–178, doi:10.1016/0012-365X(73)90108-8
Voloshin, Vitaly I. (2002), 《Coloring Mixed Hypergraphs: Theory, Algorithms and Applications.》, American Mathematical Society, ISBN 978-0-8218-2812-0
Wilf, H. S. (1986), 《Algorithms and Complexity》, Prentice–Hall, ISBN 978-0-13-021973-2
k 색상을 사용하여 3개의 꼭지점이 있는 꼭지점 그래프의 모든 적절한 꼭지점 색상 지정  k=0,1,2,3 . 각 그래프의 채색 다항식은 적절한 색상 수를 통해 보간된다.
위 세 그래프는 채색다항식  (x-2)(x-1)^{3}x를 갖는다.