论文标题

使用$ o(p)$颜色的网格的$ p $中心着色

A $p$-centered coloring for the grid using $O(p)$ colors

论文作者

Francis, Mathew, Pattanayak, Drimit

论文摘要

图$ g $的$ p $中性着色,其中$ p $是一个正整数,是$ g $的顶点的颜色,以使每个连接的子图的$ g $的每个连接子用品都包含具有独特颜色的顶点,或者包含超过$ p $ $ p $不同的颜色的顶点。我们使用$ o(p)$颜色为平面网格提供明确的以$ p $为中心的着色。

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.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源