三次平面图作为墙图拓扑Minor的多项式时间算法
离散数学
2023-02-23 v3
摘要
在本注记中，我们给出一个证明：我们可以高效地在足够大的墙图中找到作为拓扑 minor 的三次平面图。该结果作为中间步骤用于修正我博士论文中的一处证明。
引用
@article{arxiv.2302.03461,
title = {Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time},
author = {Antoine Amarilli},
journal= {arXiv preprint arXiv:2302.03461},
year = {2023}
}
备注
V2: Updated to fix an error in the proof pointed out by Mika\"el Monet. V3: Updated to point out alternative and simpler proof route following https://cstheory.stackexchange.com/a/52489