Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most Three

Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy

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 graph…