Abstract
In this paper, we present a simple inductive proof of some recently published bounds to the chromatic polynomial of a graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. D. Birkhoff, A determinant formula for the number of ways of coloring a map. Ann. Math. 14 (1912), 42–46.
K. Dohmen, A Contribution to the Chromatic Theory of Uniform Hypergraphs, Result. Math. 28 (1995), 49–52.
K. Dohmen, Lower Bounds and Upper Bounds for Chromatic Polynomials, J. Graph Theory 17 (1993), 75–80.
R. C. Read and W. T. Tutte, Chromatic Polynomials. In: Selected Topics in Graph Theory III (eds. L.W. Beineke & R. J. Wilson), Academic Press, New York (1988), 15–42.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dohmen, K. Bounds to the Chromatic Polynomial of a Graph. Results. Math. 33, 87–88 (1998). https://doi.org/10.1007/BF03322072
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03322072