2000 character limit reached
Testing isomorphism of circular-arc graphs in polynomial time (1903.11062v2)
Published 26 Mar 2019 in cs.DS and math.CO
Abstract: A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be tested by the Weisfeiler-Leman algorithm after individualization of two vertices.