An attempt to classify bipartite graphs by their chromatic Polynomial.
For the purpose of tackling the four-colour problem, Birkhoff (1912) introduced the chromatic polynomial of a map, denoted by P(M,A), which is a number of proper Acolouring of a map M. Whitney (1932), who established many fundamental results for it, later generalized the notion of a chromatic polyno...
Saved in:
| Main Author: | |
|---|---|
| Format: | Monograph |
| Published: |
Universiti Sains Malaysia
2009
|
| Subjects: | |
| Online Access: | http://eprints.usm.my/31793/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|