A decidability algorithm for strongly asymmetric graphs
From MaRDI portal
Publication:2754528
zbMATH Open0989.05117MaRDI QIDQ2754528
Publication date: 11 November 2001
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
This page was built for publication: A decidability algorithm for strongly asymmetric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754528)