Testing isomorphism of circular-arc graphs in polynomial time
Data Structures and Algorithms
2019-07-15 v2 Combinatorics
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.
Cite
@article{arxiv.1903.11062,
title = {Testing isomorphism of circular-arc graphs in polynomial time},
author = {Roman Nedela and Ilia Ponomarenko and Peter Zeman},
journal= {arXiv preprint arXiv:1903.11062},
year = {2019}
}
Comments
Dear reader, recently we have found a problem in the proof of the main theorem. It seems that we will be able to fill in the gap in the arguments, and we are doing our best to do this as soon as possible. We appologize for publishing an unfinished work. The authors