The reconfiguration graph $R_k\left(G\right)$ for the $k$-colorings of a graph $G$ has as vertices all possible $k$-colorings of $G$ and two colorings are adjacent if they differ in the color of exactly one vertex. A result of Bousquet and Perarnau (2016) regarding graphs of bounded degeneracy implies that for a planar graph $G$ with $n$ vertices, $R_{12}\left(G\right)$ has diameter at most $6n$, and if $G$ is triangle-free, then $R_8\left(G\right)$ has diameter at most $4n$. We use a list coloring technique inspired by results of Thomassen to improve on the number of colors, showing that for a planar graph $G$ with $n$ vertices, $R_{10}\left(G\right)$ has diameter at most $8n$, and if $G$ is triangle-free, then $R_7\left(G\right)$ has diameter at most $7n$.

重新配置图 ${\mathrm{[R}}_{ķ}（G）$ 为了 $ķ$图的颜色 $G$ 具有所有可能的顶点 $ķ$的颜色 $G$如果两种颜色的恰好一个顶点的颜色不同，则它们是相邻的。Bousquet和Perarnau（2016）关于有限退化图的结果表明，对于平面图$G$ 和 $ñ$ 顶点 ${\mathrm{[R}}_{12}（G）$ 直径最大 $6ñ$， 而如果 $G$ 没有三角形，那么 ${\mathrm{[R}}_8（G）$ 直径最大 $4ñ$。我们根据托马森（Thomassen）的结果启发使用列表着色技术来改进颜色数量，从而显示出平面图$G$ 和 $ñ$ 顶点 ${\mathrm{[R}}_{10}（G）$ 直径最大 $8ñ$， 而如果 $G$ 没有三角形，那么 ${\mathrm{[R}}_7（G）$ 直径最大 $7ñ$。