Chromatic polynomials and chromaticity of graphs
By: F.M. Dong, K.M. Koh and K.L. Teo
Contributors: Koh, K. M. (Khee Meng), 1944-; Teo, K. L.
Publisher: World Scientific Pub.
Published: 2005
Place of publication: Singapore
Language: eng
Format: [electronic resource] /
Number of pages: 356
ISBN-13: 9789812569462; 9781281881090
Subjects: Graphic Methods; MATHEMATICS; Graph theory; Polynomials; Graph coloring
Description: 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.
Notes: Includes bibliographical references (p. 327-352) and index.

Description based on print version record.
Table of contents: title: 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 Multi-Partite 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)