AI Summaryllama-3.1-8b-instruct
This paper proves that the minimum edge-outerplanarity of a planar graph can be computed in polynomial time.
Provides a polynomial time algorithm for computing minimum edge-outerplanarity of planar graphs, resolving an open problem.
Before reading this…
Applications
- →Graph drawing
- →Layout algorithms
Skill Ladder
To understand this paper, make sure you know these concepts first:
- Understanding of planar graphs, graph theory, and polynomial time algorithmsfind papers →
Abstract
More Like ThisWe 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.