scientific article; zbMATH DE number 6146491

DOI10.4230/LIPIcs.STACS.2008.1327zbMath1259.68164MaRDI QIDQ4910756

Fabian Wagner, Thomas Thierauf

Publication date: 19 March 2013

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_6cdb.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

On the complexity of matroid isomorphism problem ⋮ Planar and grid graph reachability problems

This page was built for publication: