Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy. Polynomial-time algorithm for isomorphism of graphs with clique-width at most three. Theoretical Computer Science, 819:9-23, 2020. [doi]
@article{DasER20,
title = {Polynomial-time algorithm for isomorphism of graphs with clique-width at most three},
author = {Bireswar Das and Murali Krishna Enduri and I. Vinod Reddy},
year = {2020},
doi = {10.1016/j.tcs.2017.09.013},
url = {https://doi.org/10.1016/j.tcs.2017.09.013},
researchr = {https://researchr.org/publication/DasER20},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {819},
pages = {9-23},
}