ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix kk and consider kk-outerplanar graphs, with the subclass of 3-connected kk-outerplanar graphs. A graph property is recognizable if it is recognized by a finite-state tree automaton; it is MSOL-definable or CMSOL-definable if it can be expressed in monadic second-order logic or counting monadic second-order logic, respectively. The kk-outerplanar recognizability conjecture. (i) For 3-connected kk-outerplanar graphs, recognizability equals MSOL-definability. (ii) For kk-outerplanar graphs, recognizability equals CMSOL-definability. The paper establishes the corresponding results for bounded-degree kk-outerplanar graphs and proposes these statements as further cases of Courcelle's conjecture; the conjecture remains open in the stated generality.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

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.

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.