## Chromatic polynomials

HTML articles powered by AMS MathViewer

- by G. D. Birkhoff and D. C. Lewis
- Trans. Amer. Math. Soc.
**60**(1946), 355-451 - DOI: https://doi.org/10.1090/S0002-9947-1946-0018401-4
- PDF | Request permission

## References

- George D. Birkhoff,
*The Reducibility of Maps*, Amer. J. Math.**35**(1913), no. 2, 115–128. MR**1506176**, DOI 10.2307/2370276 - George D. Birkhoff,
*A determinant formula for the number of ways of coloring a map*, Ann. of Math. (2)**14**(1912/13), no. 1-4, 42–46. MR**1502436**, DOI 10.2307/1967597
— - Philip Franklin,
*The Four Color Problem*, Amer. J. Math.**44**(1922), no. 3, 225–236. MR**1506473**, DOI 10.2307/2370527
— - A. B. Kempe,
*On the Geographical Problem of the Four Colours*, Amer. J. Math.**2**(1879), no. 3, 193–200. MR**1505218**, DOI 10.2307/2369235 - C. N. Reynolds Jr.,
*On the problem of coloring maps in four colors. I*, Ann. of Math. (2)**28**(1926/27), no. 1-4, 1–15. MR**1502759**, DOI 10.2307/1968351 - C. N. Reynolds Jr.,
*On the problem of coloring maps in four colors. II*, Ann. of Math. (2)**28**(1926/27), no. 1-4, 477–492. MR**1502800**, DOI 10.2307/1968392 - Clarence N. Reynolds Jr.,
*Circuits upon polyhedra*, Ann. of Math. (2)**33**(1932), no. 2, 367–372. MR**1503060**, DOI 10.2307/1968338 - Hassler Whitney,
*A logical expansion in mathematics*, Bull. Amer. Math. Soc.**38**(1932), no. 8, 572–579. MR**1562461**, DOI 10.1090/S0002-9904-1932-05460-X - Hassler Whitney,
*The coloring of graphs*, Ann. of Math. (2)**33**(1932), no. 4, 688–718. MR**1503085**, DOI 10.2307/1968214 - Hassler Whitney,
*A theorem on graphs*, Ann. of Math. (2)**32**(1931), no. 2, 378–390. MR**1503003**, DOI 10.2307/1968197
— - C. E. Winn,
*A Case of Coloration in the Four Color Problem*, Amer. J. Math.**59**(1937), no. 3, 515–528. MR**1507260**, DOI 10.2307/2371577
— - C. E. Winn,
*On the minimum number of polygons in an irreducible map*, Amer. J. Math.**62**(1940), 406–416. MR**1902**, DOI 10.2307/2371463

*On the number of ways of coloring a map*, Proceedings of the Edinburgh Mathematical Society (2) vol. 2 (1930) pp. 83-91. —

*On the polynomial expressions for the number of ways of coloring a map*, Annali dellla R. Scuola Normale Superiore di Pisa (Scienze Fisiche e Matematiche) (2) vol. 3 (1934) pp. 1-19.

*Note on the four-color problem*, Journal of Mathematics and Physics, Massachusetts Institute of Technology, vol. 16 (1938) pp. 172-184. P. J. Heawood

*Map-colour theorem*, The Quarterly Journal of Pure and Applied Mathematics vol. 24 (1890) pp. 332-338.

*A numerical equivalent of the four color map problem*, Monatshefte für Mathematik und Physik vol. 45 (1937) pp. 207-213.

*On certain reductions in the four color problem*, Journal of Mathematics and Physics, Massachusetts Institute of Technology, vol. 16 (1938) p. 159.

## Bibliographic Information

- © Copyright 1946 American Mathematical Society
- Journal: Trans. Amer. Math. Soc.
**60**(1946), 355-451 - MSC: Primary 56.0X
- DOI: https://doi.org/10.1090/S0002-9947-1946-0018401-4
- MathSciNet review: 0018401