Minimum Edge-Outerplanar Embeddings are Polynomial-Time Computable

Hantao Yu

Minimum Edge-Outerplanar Embeddings are Polynomial-Time Computable

计算复杂性 2026-07-09 v1

作者: Hantao Yu

摘要

We prove that the minimum edge-outerplanarity of a planar graph can be computed in polynomial time, resolving an open problem of Bentz (2009). The proof was initially produced by GPT~5.5 Pro and then verified and polished manually.

引用

@article{arxiv.2607.08110,
  title  = {Minimum Edge-Outerplanar Embeddings are Polynomial-Time Computable},
  author = {Hantao Yu},
  journal= {arXiv preprint arXiv:2607.08110},
  year   = {2026}
}