Can I read Chromatic Polynomials And Chromaticity Of Graphs on EtoBox?

Chromatic Polynomials And Chromaticity Of Graphs by F. M. Dong, K. M. Koh, K. L. Teo is a nonfiction available to read on EtoBox.

What is Chromatic Polynomials And Chromaticity Of Graphs 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. Basic Concepts In Graph Theory -- Notation -- The Number Of -colourings And Its Enumerations -- Chromatic Polynomials -- Chromatic Equivalence Of Graphs -- Chromaticity Of Multi-partite Graphs -- Chromaticity Of Subdivisions Of Graphs -- Graphs In Which And Two Colour Classes Induse A Tree -- Graphs In Which All But One Pair Of Colour Classes Induce Trees -- Chromaticity Of Extremal 3-colourable Graphs -- Polynomials Related To Chromatic Polynomials -- Real Roots Of Chromatic Polynomials -- Integral Roots Of Chromatic Polynomials -- Complex Roots Of Chromatic Polynomials --

Who reads Chromatic Polynomials And Chromaticity Of Graphs?

Author

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

Publisher

World Scientific Publishing Company

Published

2005

Language

EN

ISBN

9786611881092

Category

nonfiction

Subjects

Mathematics, Stem

Updated

2026-03-24