The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The isomorphism problem for planar 3-connected graphs is in unambiguous logspace |
scientific article; zbMATH DE number 5796568
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The isomorphism problem for planar 3-connected graphs is in unambiguous logspace |
scientific article; zbMATH DE number 5796568 |
Statements
The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (English)
0 references
6 October 2010
0 references
planar graph isomorphism
0 references
three connected graphs
0 references
unambiguous logspace
0 references
