Testing Mutual Duality of Planar Graphs
DOI10.1007/978-3-642-45030-3_33zbMath1407.05216OpenAlexW2962695943MaRDI QIDQ2872099
Ignaz Rutter, Thomas Bläsius, Patrizio Angelini
Publication date: 14 January 2014
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_33
Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
This page was built for publication: Testing Mutual Duality of Planar Graphs
