References
C.-Y. Chao andL.-C. Zhao, Chromatic polynomials of a family of graphs. Ars Combinatoria15, 111–129 (1983).
O.Ore, The four-color problem. New York 1967.
R. C. Read, An introduction to chromatic polynomials. J. Comb. Theory4, 52–71 (1968).
E. G.Whitehead, Jr., and L.-C.Zhao, Cutpoints and the chromatic polynomial. To appear in J. Graph Theory.
H. Whitney, The coloring of graphs. Ann. of Math.73, 688–718 (1932).
Author information
Authors and Affiliations
Additional information
This work was done, while the author was a visiting scholar at the University of Pittsburgh.
Rights and permissions
About this article
Cite this article
Chao, CY., Zhao, LC. Chromatic polynomials of connected graphs. Arch. Math 43, 187–192 (1984). https://doi.org/10.1007/BF01193920
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01193920