

























S. Negami conjectured in $1988$ that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It follows from the works of D. Archdeacon, M. Fellows, P. Hliněný, and S. Negami that this conjecture is true if the graph $K_{1, 2, 2, 2}$ has no finite planar cover. We prove a number of structural results about putative finite planar covers of $K_{1,2,2,2}$ that may be of independent interest. We then apply these results to prove that $K_{1, 2, 2, 2}$ has no planar cover of fold number less than $14$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。