The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. We give a polynomial time graph isomorphism algorithm for graphs with clique-width at most three. Our work is independent of the work by Grohe et al. [1] showing that the isomorphism problem for graphs of bounded clique-width is polynomial time.

中文翻译：

---

最多具有三个集团宽度的图的同构的多项式时间算法

集团宽度是将图分解为某些树状结构的复杂程度的度量。具有有界集团宽度的图类包含有界树宽度图。对于最多具有三个集团宽度的图，我们给出了多项式时间图同构算法。我们的工作独立于Grohe等人的工作。文献[1]表明有界宽度图的同构问题是多项式时间。