The following publications are possibly variants of this publication:
- The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous LogspaceThomas Thierauf, Fabian Wagner. mst, 47(3):655-673, 2010. [doi]
- The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous LogspaceThomas Thierauf, Fabian Wagner. STACS 2008: 633-644 [doi]
- 5-free Graphs is in Unambiguous LogspaceThomas Thierauf, Fabian Wagner. cjtcs, 2014, 2014. [doi]
- 5-free Graphs is in Unambiguous LogspaceThomas Thierauf, Fabian Wagner. cjtcs, 2015, 2015. [doi]