Questions tagged [cliquewidth]

The tag has no usage guidance.

1 question with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
18
votes
0answers
401 views

Courcelle's theorem for bounded clique-width graphs

Courcelle's theorem states that "Every graph property which is expressible in monadic second order logic is decidable in linear time for bounded tree-width graphs". Later it was extended to bounded ...