Description 
1 online resource (xxvii, 356 pages) : illustrations 
Contents 
Preface; Contents; Basic Concepts in Graph Theory; Notation; Chapter 1 The Number of Colourings and Its Enumerations; Chapter 2 Chromatic Polynomials; Chapter 3 Chromatic Equivalence of Graphs; Chapter 4 Chromaticity of MultiPartite Graphs; Chapter 5 Chromaticity of Subdivisions of Graphs; Chapter 6 Graphs in Which any Two Colour Classes Induce a Tree (I); Chapter 7 Graphs in Which any Two Colour Classes Induce a Tree (II); Chapter 8 Graphs in Which All but One Pair of Colour Classes Induce Trees (I); Chapter 9 Graphs in Which All but One Pair of Colour Classes Induce Trees (II) 
Summary 
This is the first book to comprehensively cover chromatic polynomialsof graphs. It includes most of the known results and unsolved problemsin the area of chromatic polynomials. Dividing the book into threemain parts, the authors take readers from the rudiments of chromaticpolynomials to more complex topics: the chromatic equivalence classesof graphs and the zeros and inequalities of chromatic polynomials 
Bibliography 
Includes bibliographical references (pages 327352) and index 
Notes 
Print version record 
Subject 
Graph coloring.


Graph theory.


Polynomials.

Form 
Electronic book

Author 
Koh, K. M. (Khee Meng), 1944


Teo, K. L.

ISBN 
1281881090 

9781281881090 

9789812569462 (electronic bk.) 

9812569464 (electronic bk.) 
