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

MLA

Thierauf, Thomas, and Fabian Wagner. The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace. 2008. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.0802.2825&authtype=sso&custid=ns315887.

APA

Thierauf, T., & Wagner, F. (2008). The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace.

Chicago

Thierauf, Thomas, and Fabian Wagner. 2008. “The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.0802.2825&authtype=sso&custid=ns315887.