𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chromatic Polynomials And Chromaticity Of Graphs

✍ Scribed by F. M. Dong

Book ID
127447973
Publisher
World Scientific
Year
2005
Tongue
English
Weight
9 MB
Edition
illustrated edition
Category
Library
City
New Jersey
ISBN-13
9789812563835

No coin nor oath required. For personal study only.

✦ 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.

✦ Subjects

Теория графов

📜 SIMILAR VOLUMES

Chromatic Polynomials and Chromaticity o
Chromatic Polynomials and Chromaticity of Graphs || FRONT MATTER
✍ Dong, F M; Koh, K M; Teo, K L 📂 Article 📅 2005 🏛 WORLD SCIENTIFIC 🌐 English ⚖ 905 KB

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 com

On σ-polynomials and a class of chromati
On σ-polynomials and a class of chromatically unique graphs
✍ Qingyan Du 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 655 KB

Du, Q., On o-polynomials and a class of chromatically unique graphs, Discrete Mathematics 115 (1993) 153-165. Let cr(G)=C:,,aicr '-' be the u-polynomial of a graph G. We ask the question: When k and a, are given, what is the largest possible value of ai(O < i < k) for any graph G? In this paper, thi