Testing Mutual Duality of Planar Graphs

DOI10.1007/978-3-642-45030-3_33MaRDI QIDQ2872099zbMATH OpenOpenAlexFDO

Authors Patrizio Angelini, Thomas Bläsius, Ignaz Rutter

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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Testing planarity of partially embedded graphs
• Testing Planarity of Partially Embedded Graphs
• Planarity testing of doubly periodic infinite graphs
• Testing simultaneous planarity when the common graph is 2-connected
• Testing simultaneous planarity when the common graph is 2-connected
• Algorithm and Experiments in Testing Planar Graphs for Isomorphism
• On the linearity of testing planarity of graphs
• On two dual classes of planar graphs
• scientific article; zbMATH DE number 140100

Cited in

(3)

• scientific article; zbMATH DE number 496022 (Why is no real title available?)
• Testing Planarity of Partially Embedded Graphs
• Testing mutual duality of planar graphs

This page was built for publication: Testing Mutual Duality of Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872099)