A note on clique-width and tree-width for structures
Logic in Computer Science
2008-06-03 v2
Abstract
We give a simple proof that the straightforward generalisation of clique-width to arbitrary structures can be unbounded on structures of bounded tree-width. This can be corrected by allowing fusion of elements.
Cite
@article{arxiv.0806.0103,
title = {A note on clique-width and tree-width for structures},
author = {Hans Adler and Isolde Adler},
journal= {arXiv preprint arXiv:0806.0103},
year = {2008}
}