# 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 ?

Keywords: coloring; partition; planar graph