Source authenticated
Minimum Edge-Outerplanar Embedding
Can the minimum edge-outerplanarity of a finite loopless planar graph, minimized over all planar embeddings, be computed in polynomial time? Asked by Bentz in 2009.
Exact FrontierDelta
Prior state unknown→proved
Scope and record
Occurred: Jul 9, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. Imported under CC BY 4.0.
Canonical aliases: Minimum Edge-Outerplanar Embedding · Edge-outerplanarity
Confidence: Not scored
Registry verification: unreviewed · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
Hantao Yu
human · human collaborator
GPT-5.5 Pro
model · ai model contributor · OpenAI
Lineage and corrections
This event attributed to Hantao Yu
This event attributed to GPT-5.5 Pro