Das, BireswarBireswarDasEnduri, Murali KrishnaMurali KrishnaEnduriReddy, I. VinodI. VinodReddy2025-08-302025-08-302020-06-0210.1016/j.tcs.2017.09.0132-s2.0-85030479039https://d8.irins.org/handle/IITG2025/22305The 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.trueAlgorithm | Clique-width | Graph isomorphismArticlehttps://arxiv.org/pdf/1506.016959-232 June 20201arJournal1WOS:000524292900002