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

Chromatic Polynomials and Chromaticity of Graphs || FRONT MATTER

โœ Scribed by Dong, F M; Koh, K M; Teo, K L

Book ID
125497422
Publisher
WORLD SCIENTIFIC
Year
2005
Tongue
English
Weight
905 KB
Edition
1
Category
Article
ISBN
9812569464

No coin nor oath required. For personal study only.

โœฆ Synopsis

This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book into three main parts, the authors take readers from the rudiments of chromatic polynomials to more complex topics: the chromatic equivalence classes of graphs and the zeros and inequalities of chromatic polynomials. The early material is well suited to a graduate level course while the latter parts will be an invaluable resource for postgraduate students and researchers in combinatorics and graph theory.

๐Ÿ“œ SIMILAR VOLUMES

Chromatic Polynomials And Chromaticity O
Chromatic Polynomials And Chromaticity Of Graphs
โœ F. M. Dong ๐Ÿ“‚ Library ๐Ÿ“… 2005 ๐Ÿ› World Scientific ๐ŸŒ English โš– 9 MB

This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book into three main parts, the authors take readers from the rudiments of chromatic polynomials to more com

Chromatic polynomials, polygon trees, an
Chromatic polynomials, polygon trees, and outerplanar graphs
โœ C. D. Wakelin; D. R. Woodall ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 370 KB

## Abstract It is proved that all classes of polygon trees are characterized by their chromatic polynomials, and a characterization is given of those polynominals that are chromatic polynomials of outerplanar graphs. The first result yields an alternative proof that outerplanar graphs are recogniza