An attempt to classify bipartite graphs by their chromatic Polynomial.

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

Full description

Bibliographic Details
Main Author: Hasni, Roslan
Format: Monograph
Published: Universiti Sains Malaysia 2009
Subjects:
QA Mathematics
Online Access:http://eprints.usm.my/31793/

Similar Items

Similar Items