论文信息 - Lower bounds and upper bounds for chromatic polynomials - 字舞流文

Lower bounds and upper bounds for chromatic polynomials

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.

Klaus Dohmen | Klaus Dohmen

[1] Felix Lazebnik. On the greatest number of 2 and 3 colorings of a (v, e)-graph , 1989, J. Graph Theory.

[2] G. Birkhoff. A Determinant Formula for the Number of Ways of Coloring a Map , 1912 .

[3] H. Whitney. A logical expansion in mathematics , 1932 .

[4] Felix Lazebnik,et al. Some corollaries of a theorem of Whitney on the chromatic polynomial , 1991, Discret. Math..

[5] Felix Lazebnik,et al. New upper bounds for the greatest number of proper colorings of a (V, E)-graph , 1990, J. Graph Theory.

[6] G. Meredith,et al. Coefficients of chromatic polynomials , 1972 .