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.
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Editorial Reviews
Review
This book is clearly written, well illustrated, and supplied with carefully designed exercises. -- Zentralblatt MATH
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
Let G be a graph and N. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
chromatic uniqueness, chromatic roots, adjoint equivalence class, chromatic equivalence classes, two simplicial vertices, additive over the components, pure cycle, simplicial vertex, adjoint uniqueness, chromatic polynomials, chromatic coefficients, adjoint polynomials, certain bipartite graphs, complete tripartite graphs, chordal graph, factorial form, partite sets, unique graphs, polygon trees, chromatic classes, matching polynomial, spanning subgraph, broken cycles, independent partition, generalized triangle Key Phrases - Capitalized Phrases (CAPs): (learn more)
Chromaticity of Subdivisions of Graphs, Chromatic Equivalence of Graphs, Two Colour Classes Induce, Unimodal Conjecture New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Let G be a graph and N. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
chromatic uniqueness, chromatic roots, adjoint equivalence class, chromatic equivalence classes, two simplicial vertices, additive over the components, pure cycle, simplicial vertex, adjoint uniqueness, chromatic polynomials, chromatic coefficients, adjoint polynomials, certain bipartite graphs, complete tripartite graphs, chordal graph, factorial form, partite sets, unique graphs, polygon trees, chromatic classes, matching polynomial, spanning subgraph, broken cycles, independent partition, generalized triangle Key Phrases - Capitalized Phrases (CAPs): (learn more)
Chromaticity of Subdivisions of Graphs, Chromatic Equivalence of Graphs, Two Colour Classes Induce, Unimodal Conjecture New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 7
books:
See all 7 books this book cites
- Graph Theory (Cambridge Mathematical Library) by W. T. Tutte on 5 pages
- Computational Excursions in Analysis and Number Theory by Peter Borwein in Back Matter
- Matrix Theory, Vol. 2 by Felix R. Gantmacher in Back Matter
- Applied Mathematics by Raymond A. Barnett in Back Matter
- Matroid Applications (Encyclopedia of Mathematics and its Applications) by Neil White in Back Matter
See all 7 books this book cites
Books on Related Topics
(learn more)
|
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
