content_image/390114.jpg
<img src='content_image/390114.jpg'>

[1] L. Pauling, J. Am. Chem. Soc. 57 , 2680 (1935). 

[2] W. F. Giauque and J. W. Stout, J. Am. Chem. Soc. 58 1144 (1936). 

[3] B. A. Berg, C. Muguruma, and Y. Okamoto, Phys. Rev. B 75 , 092202 (2007). 

[4] This is in contrast to systems where nonzero ground state entropy is associated with frustration, including the Ising antiferromagnet on the triangular lattice, spin glasses, and spin ice materials such as pyrochlores. 

[5] F. Y. Wu, Rev. Mod. Phys. 54 , 235 (1982). 

[6] R. J. Baxter, Exactly Solved Models (Oxford Univ. Press, Oxford, 1982). 

[7] Y. Chow and F. Y. Wu, Phys. Rev. B 36 , 285 (1987). 

[8] For some recent discussions of chromatic polynomials, see talks by N. Biggs, S.-C. Chang, F. M. Dong, B. Jackson, J. Jacobsen, G. Royle, R. Shrock, A. Sokal, C. Thomassen, et al. in Workshop on Zeros of Graph Polynomials (2008), Newton Institute for Mathematical Sciences, Cambridge University, 

http://www.newton.ac.uk/programmes/CSM/seminars. 

[9] L. Beaudin, J. Ellis-Monaghan, G. Pangborn, and R. Shrock, arXiv:0804.2468. 

[10] R. Shrock and S.-H. Tsai, Phys. Rev. E 55 , 5165 (1997). 

[11] N. L. Biggs, Bull. London Math. Soc. 9 , 54 (1977). 

[12] R. Shrock and S.-H. Tsai, Phys. Rev. E 55 , 6791 (1997). 

[13] R. Shrock and S.-H. Tsai, Phys. Rev. E 56 , 2733 (1997). 

[14] R. Shrock and S.-H. Tsai, Phys. Rev. E 56 , 4111 (1997). 

[15] S.-H. Tsai, Phys. Rev. E 57 , 2686 (1998). 

[16] S.-C. Chang and R. Shrock, Physica A 316 , 335 (2002). 

[17] P. Lancaster and M. Tismenetsky, The Theory of Ma- trices, with Applications (New York, Academic Press, 1985). 

[18] H. Minc, Nonnegative Matrices (New York, Wiley, 1988). 

[19] D. London, Duke Math. J. 33 , 511 (1966). 

[20] N. L. Biggs, R. M. Damerell, and D. A. Sands, J. Combin. Theory 12 , 123 (1972). 

[21] R. Shrock and S.-H. Tsai, Phys. Rev. E 56 , 3935 (1997); J. Phys. A 31 , 9641 (1998); Physica A A265 , 186 (1999). 

[22] A. Sokal, Combin. Probab. Comput. 18 , 221 (2004). 

[23] The girth of a graph G , g ( G ) is defined as the number of edges of a minimal-length closed circuit on G . 

[24] J. F. Nagle, J. Combin. Theory 10 , 42 (1971). 

[25] G. A. Baker, Jr., J. Combin. Theory 10 , 217 (1971). 

[26] N. L. Biggs and G. H. J. Meredith, J. Combin. Theory B 20 , 5 (1976). 

[27] D. Kim and I. G. Enting, J. Combin. Theory B 26 , 327 (1979). 

[28] A. V. Bakaev and V. I. Kabanovich, J. Phys. A 27 , 6731 (1994). 

[29] X. Y. Chen and C. Y. Pan, Int. J. Mod. Phys. B 2 , 1495 (1988). 

[30] R. Shrock and S.-H. Tsai, Phys. Rev. E 58 , 4332 (1998), cond-mat/9808057. 

[31] M. Roˇ cek, R. Shrock, and S.-H. Tsai, Physica A 252 , 505 (1998). 

[32] R. Shrock and S.-H. Tsai, Phys. Rev. E 60 , 3512 (1999); Physica A 275 , 429 (2000). 

[33] R. Shrock, Phys. Lett. A 261 , 57 (1999). 

[34] J. Salas and R. Shrock, Phys. Rev. E 64 , 011111 (2001). 

[35] S.-H. Chang and R. Shrock, Physica A 290 , 402 (2001). 

[36] N. L. Biggs and R. Shrock, J. Phys. A (Letts) 32 , L489 (1999). 

[37] E. H. Lieb, Phys. Rev. 162 , 162 (1967). 

