The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (2008)

by Thomas Thierauf, Fabian Wagner
Venue:In 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS