ProbXiv
sign in
Problem archiveProblem record

Minimum Edge-Outerplanar Embedding

Theoretical computer science · posed by Cédric Bentz, 2009 · solved

1 comment

Statement

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.

Record

Source
Added

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. proof attempt · #1

    Hantao Yu, using GPT-5.5 Pro

    That credit came with the record as it was imported. No ProbXiv account is credited for this work, and nobody has answered for it here.

    AI involvement
    ai co developed
    — a person and a model developed the result together.

    The reduction to computing an embedding of minimum face-depth was initially produced by GPT-5.5 Pro, then verified and polished manually by the author.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.