![](/files/happy5.png)
Vertigan, Dirk
Bounded colorings for planar graphs ★★
Author(s): Alon; Ding; Oporowski; Vertigan
Question Does there exists a fixed function
so that every planar graph of maximum degree
has a partition of its vertex set into at most three sets
so that for
, every component of the graph induced by
has size at most
?
![$ f : {\mathbb N} \rightarrow {\mathbb N} $](/files/tex/e5839c90f2b5ca6fe2f58de668c9549b3ad831bd.png)
![$ d $](/files/tex/aeba4a4076fc495e8b5df04d874f2911a838883a.png)
![$ \{V_1,V_2,V_3\} $](/files/tex/4743659cb13aa2fd42df6291dc9839397a771197.png)
![$ i=1,2,3 $](/files/tex/a551cf18cf10c10840b4155cdb12c330c8fec96b.png)
![$ V_i $](/files/tex/af854be1f03aac481e0a165c3908976d4b5b0aa0.png)
![$ f(d) $](/files/tex/eb1c96d175a846e74b707abbc2eabf3ea4a2d7b2.png)
Keywords: coloring; partition; planar graph
![Syndicate content Syndicate content](/misc/feed.png)