We study the graph parameter elimination distance to bounded degree, which was introduced by Bulian and Dawar in their study of the parameterized complexity of the graph isomorphism problem. We prove that the problem is fixed-parameter tractable on planar graphs, that is, there exists an algorithm that given a planar graph $G$ and integers $d$ and $k$ decides in time $f(k,d)\cdot n^c$ for a computable function~$f$ and constant $c$ whether the elimination distance of $G$ to the class of degree $d$ graphs is at most $k$.

翻译：我们研究由Bulian和Dawar在图同构问题的参数化复杂性研究中引入的图参数“消除距离到有界度”。我们证明该问题在平面图上具有固定参数可解性，即存在一种算法，给定平面图$G$以及整数$d$和$k$，能在时间$f(k,d)\cdot n^c$内（其中$f$为可计算函数，$c$为常数）判定$G$到度数为$d$的图类的消除距离是否不超过$k$。