Lower bounds and upper bounds for chromatic polynomials
- 1 March 1993
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 17 (1) , 75-80
- https://doi.org/10.1002/jgt.3190170109
Abstract
In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on n vertices having m edges and girth exceeding g © 1993 John Wiley & Sons, Inc.Keywords
This publication has 6 references indexed in Scilit:
- Some corollaries of a theorem of Whitney on the chromatic polynomialDiscrete Mathematics, 1991
- New upper bounds for the greatest number of proper colorings of a (V,E)‐graphJournal of Graph Theory, 1990
- On the greatest number of 2 and 3 colorings of a (v, e)‐graphJournal of Graph Theory, 1989
- Coefficients of chromatic polynomialsJournal of Combinatorial Theory, Series B, 1972
- A logical expansion in mathematicsBulletin of the American Mathematical Society, 1932
- A Determinant Formula for the Number of Ways of Coloring a MapAnnals of Mathematics, 1912