Description |
1 online resource (xxvii, 356 pages) : illustrations |
Physical Medium |
polychrome |
Description |
text file |
Bibliography |
Includes bibliographical references (pages 327-352) and index. |
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 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). |
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. |
Local Note |
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America |
Subject |
Graph coloring.
|
|
Graph coloring. |
|
Graph theory.
|
|
Graph theory. |
|
Polynomials.
|
|
Polynomials. |
Genre/Form |
Electronic books.
|
Added Author |
Koh, K. M. (Khee Meng), 1944-
|
|
Teo, K. L.
|
Other Form: |
Print version: Dong, F.M. Chromatic polynomials and chromaticity of graphs. Singapore : World Scientific Pub., 2005 9812563830 9812563172 (DLC) 2006295259 (OCoLC)61262731 |
ISBN |
9812569464 (electronic book) |
|
9789812569462 (electronic book) |
|
1281881090 |
|
9781281881090 |
|