Efficient Extraction of Multiple Kuratowski Subdivisions (Q5452219): Difference between revisions

@@ Property / cites work @@
+An experimental comparison of four graph drawing algorithms.
+Normal rank
@@ Property / cites work @@
+Graph Drawing
@@ Property / cites work: Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252282
@@ Property / cites work: Q4252282 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
+Normal rank
@@ Property / cites work @@
+Efficient Extraction of Multiple Kuratowski Subdivisions
+Normal rank
@@ Property / cites work @@
+Maintenance of a minimum spanning forest in a dynamic plane graph
+Normal rank
@@ Property / cites work @@
+On Cotree-Critical and DFS Cotree-Critical Graphs
@@ Property / cites work: On Cotree-Critical and DFS Cotree-Critical Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of planar graphs by Trémaux orders
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum planar subgraphs and nice embeddings: Practical layout tools
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Kuratowski Subgraphs
@@ Property / cites work: Depth-First Search and Kuratowski Subgraphs / rank @@
+Normal rank