Density of Chromatic Roots in Minor-Closed Graph Families
暂无分享,去创建一个
[1] K. Wagner. Über eine Eigenschaft der ebenen Komplexe , 1937 .
[2] Carsten Thomassen,et al. The Zero-Free Intervals for Chromatic Polynomials of Graphs , 1997, Combinatorics, Probability and Computing.
[3] Alan D. Sokal,et al. Chromatic Roots are Dense in the Whole Complex Plane , 2000, Combinatorics, Probability and Computing.
[4] G. Birkhoff. A Determinant Formula for the Number of Ways of Coloring a Map , 1912 .
[5] Thomas J. Perrett. Roots of the Chromatic Polynomial , 2017 .
[6] Alan D. Sokal,et al. Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models. I. General Theory and Square-Lattice Chromatic Polynomial , 2001 .
[7] Bill Jackson,et al. A Zero-Free Interval for Chromatic Polynomials of Graphs , 1993, Combinatorics, Probability and Computing.
[8] Christopher David. Chromatic Polynomials , 2016 .
[9] G. Royle. Planar Triangulations with Real Chromatic Roots Arbitrarily Close to 4 , 2005, math/0511304.
[10] W. T. Tutte. THE GOLDEN RATIO IN THE THEORY OF CHROMATIC POLYNOMIALS. , 1970 .