Das, BireswarBireswarDasEnduri, Murali KrishnaMurali KrishnaEnduriVinod Reddy, I.I.Vinod Reddy2025-08-302025-08-302016-01-01[9783319426334]10.1007/978-3-319-42634-1_52-s2.0-84979255142http://repository.iitgn.ac.in/handle/IITG2025/21982The 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 and Schweitzer [17] showing that the isomorphism problem for graphs of bounded cliquewidth is polynomial time.falseConference Paperhttps://arxiv.org/pdf/1506.016951611334955-66201600