Planarity for clustered graphs (Q6102302): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-60313-1_145
+Normal rank
@@ Property / OpenAlex ID @@
+W1487870695
@@ Property / OpenAlex ID: W1487870695 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993087
@@ Property / cites work: Q3993087 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+A linear algorithm for embedding planar graphs using PQ-trees
+Normal rank
@@ Property / cites work @@
+A Depth-First-Search Characterization of Planarity
+Normal rank
@@ Property / cites work @@
+Computing an st-numbering
@@ Property / cites work: Computing an st-numbering / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Number is NP-Complete
@@ Property / cites work: Crossing Number is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q5596083
@@ Property / cites work: Q5596083 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs: Theory and algorithms
@@ Property / cites work: Planar graphs: Theory and algorithms / rank @@
+Normal rank