Chromatic polynomials and chromaticity of graphs

Chromatic polynomials and chromaticity of graphs

by K. L. Teo, K. M. Koh, F. M. Dong

Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
"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."--BOOK JACKET.

Discuss Chromatic polynomials and chromaticity of graphs with other readers

Join or start a book club for Chromatic polynomials and chromaticity of graphs on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Chromatic polynomials and chromaticity of graphs?

Sign up free on Readfeed, then browse public clubs or start your own club with Chromatic polynomials and chromaticity of graphs as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Chromatic polynomials and chromaticity of graphs with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Chromatic polynomials and chromaticity of graphs with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.