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!
|
| Summary: | 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 polynomial to that of an arbitrary graph. In 1968, Read asked whether it is possible to find a set of necessary and sufficient algebraic conditions for a polynomial to be the chromatic polynomial of some graph. In particular, Read asked for a necessary and sufficient condition for two graphs to be chromatically equivalent; that is, to have the same chromatic polynomial. In 1978, Chao and Whitehead defined a graph to be chromatically unique if no other graphs share its chromatic
polynomial. Since then many researchers have been studying chromatic uniqueness and chromatic equivalence of graphs.
|
|---|