2000 character limit reached
3-connected Planar Graph Isomorphism is in Log-space
Published 5 Jun 2008 in cs.CC | (0806.1041v1)
Abstract: We show that the isomorphism of 3-connected planar graphs can be decided in deterministic log-space. This improves the previously known bound UL$\cap$coUL of Thierauf and Wagner.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.