Polychromatic colorings of bounded degre
โ
Elad Horev; Roi Krakovski
๐
Article
๐
2009
๐
John Wiley and Sons
๐
English
โ 289 KB
## Abstract A __polychromatic k__โ__coloring__ of a plane graph __G__ is an assignment of __k__ colors to the vertices of __G__ such that every face of __G__ has __all k__ colors on its boundary. For a given plane graph __G__, one seeks the __maximum__ number __k__ such that __G__ admits a polychro