---
tag: YY4JBMXMXQ
kind: concept
name: Clique-width
aliases: [cliquewidth]
sources:
  - wikipedia: en:16795502@r1374515339
    locator: Clique-width
    note: adopted
    mention: wikipedia://en/16795502
    sections: [Summary]
same_as:
  wikidata: Q1101814
  wikipedia: Clique-width
inventory: [7B8RCE4BSK]
---

## Summary

In graph theory, the **clique-width** of a [[graph|00C0BR7D7H]] $G$ is a parameter that describes the structural complexity of the graph; it is closely related to treewidth, but unlike treewidth it can be small for dense graphs. It is defined as the minimum number of labels needed to construct $G$ by means of the following 4 operations :