Isomorphism of Planar Graphs (Working Paper)

DOI10.1007/978-1-4684-2001-2_13zbMath1467.68142OpenAlexW2108471507MaRDI QIDQ4999429

John E. Hopcrofts, Robert Endre Tarjan

Publication date: 6 July 2021

Published in: Complexity of Computer Computations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4684-2001-2_13

zbMATH Keywords

planar graphisomorphism problemisomorphic graph

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (9)

The QAP-polytope and the graph isomorphism problem ⋮ Two-closure of rank \(3\) groups in polynomial time ⋮ Isomorphism Testing Parameterized by Genus and Beyond ⋮ Cross-series-parallel digraphs ⋮ Block elimination distance ⋮ Block elimination distance ⋮ The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs ⋮ Enumeration of articulation pairs of a planar graph ⋮ The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs

This page was built for publication: Isomorphism of Planar Graphs (Working Paper)