Chromatic Polynomial
| dc.contributor.advisor | Tsegaye Yirgalem | |
| dc.contributor.author | Tamiru Abebu | |
| dc.date.accessioned | 2019-04-17T08:54:41Z | |
| dc.date.accessioned | 2023-11-18T09:50:13Z | |
| dc.date.available | 2019-04-17T08:54:41Z | |
| dc.date.available | 2023-11-18T09:50:13Z | |
| dc.date.issued | 2018-05-07 | |
| dc.description.abstract | In this project, based on articles published by(Coudy Fouts), we see how Incidence Algebrain particular, M obius Inversion Theorem is used to compute the Chromatic Polynomials of graphs. This is one of the various applications of M obius Inversion Theorem. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/12345678/18003 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Preliminaries Chromatic polynomials | en_US |
| dc.title | Chromatic Polynomial | en_US |
| dc.type | Thesis | en_US |