Editing Chromatic polynomial (section)

== References ==
{{refbegin|2}}
*{{Citation
|last=Biggs | first=N.
|title=Algebraic Graph Theory
|publisher=Cambridge University Press
|year=1993
|isbn=978-0-521-45897-9
}}
*{{Citation
|last1=Chao | first1=C.-Y.
|last2=Whitehead | first2=E. G.
|contribution=On chromatic equivalence of graphs
|title=Theory and Applications of Graphs
|year=1978
|volume=642
|pages=121–131
|publisher=Springer
|series=Lecture Notes in Mathematics
|isbn=978-3-540-08666-6
}}
*{{Citation
|last1= Dong | first1= F. M.
|last2= Koh | first2= K. M.
|last3=  Teo| first3= K. L.
|title=Chromatic polynomials and chromaticity of graphs
|publisher=World Scientific Publishing Company
|year=2005
|isbn= 978-981-256-317-0
}}
* {{citation|title=Structural Analysis of Complex Networks 
|chapter=Graph polynomials and their applications I: The Tutte polynomial 
|first1=Joanna A. |last1=Ellis-Monaghan | author1-link = Jo Ellis-Monaghan
|first2=Criel |last2=Merino 
|arxiv=0803.3079
|date=2011
|isbn=978-0-8176-4789-6
|editor-last=Dehmer |editor-first=Matthias
|language=en-gb 
|doi=10.1007/978-0-8176-4789-6_9
|s2cid=585250 
}}
*{{citation
 | last1 = Giménez | first1 = O.
 | last2 = Hliněný | first2 = P.
 | last3 = Noy | first3 = M.
 | contribution = Computing the Tutte polynomial on graphs of bounded clique-width
 | doi = 10.1007/11604686_6
 | pages = 59–68
 | publisher = Springer-Verlag
 | series = Lecture Notes in Computer Science
 | title = Proc. 31st Int. Worksh. Graph-Theoretic Concepts in Computer Science (WG 2005)
 | volume = 3787
 | year = 2005| isbn = 978-3-540-31000-6
 | citeseerx = 10.1.1.353.6385
 }}
*{{Citation
|last1=Goldberg | first1= L.A. | author1-link = Leslie Ann Goldberg
|last2=Jerrum | first2=  M.
|author2-link=Mark Jerrum
|title= Inapproximability of the Tutte polynomial
|journal=Information and Computation
| doi= 10.1016/j.ic.2008.04.003    
|year=2008
|volume=206
|pages=908
|issue=7
|arxiv=cs/0605140
| s2cid= 53304001 }}
*{{Citation
|last1=Helme-Guizon | first1=Laure
|last2=Rong | first2=Yongwu
|title=A categorification of the chromatic polynomial
|journal=Algebraic & Geometric Topology
| doi= 10.2140/agt.2005.5.1365   
|year=2005
|volume=5
|pages=1365–1388
|issue=4
|arxiv=math/0412264| s2cid=1339633
}}
*{{citation
 | last = Huh | first = June
 | arxiv = 1008.4749
 | doi = 10.1090/S0894-0347-2012-00731-0
 | issue = 3
 | journal = Journal of the American Mathematical Society
 | mr = 2904577
 | pages = 907–927
 | title = Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
 | volume = 25
 | year = 2012| s2cid = 13523955
 }}
*{{Citation
| doi= 10.1017/S0963548300000705
| last1= Jackson |first1= B.
| title= A Zero-Free Interval for Chromatic Polynomials of Graphs
|journal=Combinatorics, Probability and Computing
| volume= 2| issue= 3 |pages = 325–336
| year= 1993
| s2cid= 39978844 }}
*{{Citation
| doi= 10.1017/S0305004100068936
| last1= Jaeger |first1= F.
| last2= Vertigan | first2=  D. L.
| last3= Welsh | first3  =D. J. A. | authorlink3=Dominic Welsh
| title= On the computational complexity of the Jones and Tutte polynomials
| journal=[[Mathematical Proceedings of the Cambridge Philosophical Society]]
| volume= 108| issue= 1 |pages = 35–53
| year= 1990
|bibcode= 1990MPCPS.108...35J| s2cid= 121454726 }}
*{{Citation
|doi=10.1137/0607036
|last=Linial | first=N. | authorlink = Nati Linial
|title=Hard enumeration problems in geometry and combinatorics
|journal= SIAM J. Algebr. Discrete Methods
|volume= 7|issue=2|pages=331–335|year= 1986
}} 
*{{citation
 | last1 = Makowsky | first1 = J. A.
 | last2 = Rotics | first2 = U.
 | last3 = Averbouch | first3 = I.
 | last4 = Godlin | first4 = B.
 | contribution = Computing graph polynomials on graphs of bounded clique-width
 | doi = 10.1007/11917496_18
 | pages = 191–204
 | publisher = Springer-Verlag
 | series = Lecture Notes in Computer Science
 | title = Proc. 32nd Int. Worksh. Graph-Theoretic Concepts in Computer Science (WG 2006)
 | volume = 4271
 | year = 2006| isbn = 978-3-540-48381-6
 | citeseerx = 10.1.1.76.2320
 }}
*{{citation
 | last1 = Naor | first1 = J.
 | last2 = Naor | first2 = M.
 | last3 = Schaffer | first3 = A.
 | contribution = Fast parallel algorithms for chordal graphs
 | doi = 10.1145/28395.28433
 | pages = 355–364
 | title = Proc. 19th ACM Symp. Theory of Computing (STOC '87)
 | year = 1987| isbn = 978-0897912211
 | s2cid = 12132229
 | doi-access = free
 }}.
*{{Citation
|last1=Oxley | first1=J. G.
|last2=Welsh | first2=D. J. A.
|title=Chromatic, flow and reliability polynomials: The complexity of their coefficients.
|journal=[[Combinatorics, Probability and Computing]]
|volume=11
|year=2002
|issue=4
|pages=403–426
| doi=10.1017/S0963548302005175
| s2cid=14918970
}}
*{{Citation
|last1=Pemmaraju | first1=S.
|last2= Skiena | first2= S.
|title= Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica
|publisher=Cambridge University Press
|year=2003
|at=section 7.4.2
|isbn=978-0-521-80686-2
}}
*{{Citation
|last=Read | first=R. C. | author-link=Ronald C. Read
|title=An introduction to chromatic polynomials
|journal=[[Journal of Combinatorial Theory]]
|year=1968
|pages=52–71
|volume=4
|doi=10.1016/S0021-9800(68)80087-0
|url=http://dml.cz/bitstream/handle/10338.dmlcz/128421/CzechMathJ_43-1993-3_10.pdf
|doi-access=free
}}
*{{citation
 | last1 = Sekine | first1 = Kyoko
 | last2 = Imai | first2 = Hiroshi
 | last3 = Tani | first3 = Seiichiro
 | editor1-last = Staples | editor1-first = John
 | editor2-last = Eades | editor2-first = Peter
 | editor3-last = Katoh | editor3-first = Naoki
 | editor4-last = Moffat | editor4-first = Alistair
 | contribution = Computing the Tutte polynomial of a graph of moderate size
 | doi = 10.1007/BFb0015427
 | pages = 224–233
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4–6, 1995, Proceedings
 | volume = 1004
 | year = 1995| isbn = 978-3-540-60573-7
 }}
*{{Citation
|doi=10.1017/S0963548303006023
|last=Sokal | first=A. D. |author-link=Alan Sokal
|title=Chromatic Roots are Dense in the Whole Complex Plane
|journal=[[Combinatorics, Probability and Computing]] |year=2004 |pages= 221–261|volume= 13
|issue=2 
|arxiv=cond-mat/0012369|s2cid=5549332 }}
*{{Citation
| doi=10.1016/0012-365X(73)90108-8
| last=Stanley |first= R. P.
|title= Acyclic orientations of graphs
|journal= [[Discrete Mathematics (journal)|Discrete Math.]] 
|volume=5 |pages=171–178|year= 1973
| issue=2
|url=http://math.mit.edu/~rstan/pubs/pubfiles/18.pdf
}}
*{{Citation
| last= Voloshin | first= Vitaly I.
| title= Coloring Mixed Hypergraphs: Theory, Algorithms and Applications. 
| publisher=  American Mathematical Society 
| year  =2002
| isbn= 978-0-8218-2812-0
}}
*{{Citation
| last= Wilf | first= H. S. | author-link=Herbert Wilf
| title= Algorithms and Complexity
| publisher=  Prentice–Hall
| year  =1986
| isbn= 978-0-13-021973-2
}}
{{refend}}