Bounded cliquewidth under proper separator decompositions
Statement
Let and be classes of graphs closed under taking induced subgraphs. Suppose that every 2-connected graph in is either in or has a proper 2-separator or a proper -separator. Assume that, for some constant , every graph in has cliquewidth at most .
Cliquewidth preservation conjecture. There is a function such that every graph in has cliquewidth at most .
This conjecture asks whether decomposing graphs along proper 2-separators and proper -separators preserves bounded cliquewidth. Its status is not resolved in the supplied source.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.