Chromatic Polynomialls
| dc.contributor.advisor | Zeleke, Melkamu(Professor) | |
| dc.contributor.author | Derso, Getachew | |
| dc.date.accessioned | 2018-07-16T07:07:04Z | |
| dc.date.accessioned | 2023-11-04T12:32:20Z | |
| dc.date.available | 2018-07-16T07:07:04Z | |
| dc.date.available | 2023-11-04T12:32:20Z | |
| dc.date.issued | 2011-01 | |
| dc.description.abstract | The four-color theorem states that any planar graph G = (V, E) can be properly colored using at most four colors. The attempt to prove this famous mathematical problem gave rise to the development of many tools for solving problems related to graph coloring. In 1912, Birkhoff introduced a function P(G,), define for all positive integer,to be the number of all proper colorings of a graph G = (V,E).This function turns out to be a polynomial in , and one could prove the four-color theorem by showing that P(G,) >0 for all graphs G = (V, E). The polynomial P(G) is defined for all real and complex values of ,and it is called the chromatic polynomial of G = (V, E). In this project, we describe the properties of chromatic polynomials, discuss some practical methods for computing them, and look at the roots of chromatic polynomials .Classic results such as Whitney’s Broken-cycle theorem and Read’s Unimodal conjecture on the coefficients of P(G,) will also be discussed. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/8634 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | The four-color theorem states that any planar graph | en_US |
| dc.title | Chromatic Polynomialls | en_US |
| dc.type | Thesis | en_US |