3-connected Planar Graph Isomorphism is in Log-space

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/169054We 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.Computational Complexity3-connected Planar Graph Isomorphism is in Log-spacetext