Polynomial-time algorithm for isomorphism of graphs with clique-width at most three

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]

Abstract

Abstract is missing.