Thomas Thierauf, Fabian Wagner. The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. Electronic Colloquium on Computational Complexity (ECCC), 14(068), 2007. [doi]
@article{ThieraufW07,
title = {The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace},
author = {Thomas Thierauf and Fabian Wagner},
year = {2007},
url = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-068/index.html},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ThieraufW07},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {14},
number = {068},
}