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

The limit of chromatic polynomials

โœ Scribed by D Kim; I.G Enting

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
639 KB
Volume
26
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Roots of Chromatic Polynomials
On the Roots of Chromatic Polynomials
โœ Jason I. Brown ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 158 KB

It is proved that the chromatic polynomial of a connected graph with n vertices and m edges has a root with modulus at least (m&1)ร‚(n&2); this bound is best possible for trees and 2-trees (only). It is also proved that the chromatic polynomial of a graph with few triangles that is not a forest has a

Expansions of the chromatic polynomial
Expansions of the chromatic polynomial
โœ Norman Biggs ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 739 KB

The chromatic polynomial ;X chromial) of a graph was first defined by Birkhoff in 1912, ;md gives the number of ways or" properly colov iing the vertices of the graph with any number of colours. A good survey of the b-sic facts about these polynomials may be found in the article by Read [ 3 3 . It

Cutpoints and the chromatic polynomial
Cutpoints and the chromatic polynomial
โœ Earl Glen Whitehead Jr.; Lian-Chang Zhao ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 303 KB

## Abstract We prove that the multiplicity of the root 1 in the chromatic polynomial of a simple graph __G__ is equal to the number of nontrivial blocks in __G__. In particular, a connected simple graph __G__ has a cutpoint if and only if its chromatic polynomial is divisible by (ฮป โ€“ 1)^2^. We appl