The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace

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]

Abstract

Abstract is missing.