๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Chromatic polynomials with least coefficients

โœ Scribed by J. Rodriguez; A. Satyanarayana

Book ID
104113786
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
275 KB
Volume
172
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Planar graphs with least chromatic coeff
Planar graphs with least chromatic coefficients
โœ A. Sakaloglu; A. Satyanarayana ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 512 KB

A 2-coloring of a graph G is an assignment of 2 or fewer colors to the points of G so that no two adjacent points have the same color. The number of distinct 2-colorings of an n-point and e-edge graph G can be expressed by the chromatic polynomial P(G; 2) = ~7=1(-1 )"-iai(G)2i, where ai(G) are non-n

Coefficient relationship between rook an
Coefficient relationship between rook and chromatic polynomials
โœ Kang Yueh; Samuel D. Bedrosian ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 289 KB

## ABSTRACC It is shown that a p +q node graph G, representation can be drawn for a chessboard C(p, q) i.e. an array of p rows and q columns. It is shown further that the coefficients of the rook polynomial for C(p, q) correspond 1: 1 inversely with the coefficients of the chromatic polynomial for