Emergent Mind
A $p$-centered coloring for the grid using $O(p)$ colors
(2207.11496)
Published Jul 23, 2022
in
math.CO
and
cs.DM
Abstract
A $p$-centered coloring of a graph $G$, where $p$ is a positive integer, is a coloring of the vertices of $G$ in such a way that every connected subgraph of $G$ either contains a vertex with a unique color or contains more than $p$ different colors. We give an explicit construction of a $p$-centered coloring using $O(p)$ colors for the planar grid.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.