2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/162060We 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.Logic in Computer ScienceF.4.1; G.2.2text