Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4652826 | Electronic Notes in Discrete Mathematics | 2007 | 5 Pages |
Abstract
The rainbowness, rb(G), of a connected plane graph G is the minimum number k such that any colouring of vertices of the graph G using at least k colours involves a face all vertices of which receive distinct colours. We give a survey on recent results concerning ranbowness of plane graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics