Chromatic Polynomials And Chromaticity Of Graphs - Couverture souple

Dong, Fengming

Couverture souple

ISBN 10 : 9812563830 ISBN 13 : 9789812563835

Editeur : Wspc, 2005

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.

A propos du livre

Présentation de l'éditeur

“This book is clearly written, well illustrated, and supplied with carefully designed exercises, it takes pleasure in using it as an graduate textbook or for independent study. It leads the reader to the frontiers of present research in the theory of chromatic polynomials and offers insight into some exciting development.” Zentralblatt Math 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.

Détails de l'édition

• Éditeur: Wspc
• Date d'édition: 2005
• Langue: anglais
• ISBN 10: 9812563830
• ISBN 13: 9789812563835
• Reliure: Broché
• Nombre de pages: 384
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible