The Effect of Planarization on Width (Q4961755): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.7155/jgaa.00468
+Normal rank
@@ Property / OpenAlex ID @@
+W3106486826
@@ Property / OpenAlex ID: W3106486826 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Induced Subgraphs of Sparse Graphs
@@ Property / cites work: Planar Induced Subgraphs of Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with small bandwidth and cutwidth
@@ Property / cites work: Graphs with small bandwidth and cutwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365099
@@ Property / cites work: Q5365099 / rank @@
+Normal rank
@@ Property / cites work @@
+An analysis of heuristics for graph planarization
@@ Property / cites work: An analysis of heuristics for graph planarization / rank @@
+Normal rank
@@ Property / cites work @@
+On the Relationship Between Clique-Width and Treewidth
+Normal rank
@@ Property / cites work @@
+Q3043705
@@ Property / cites work: Q3043705 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved upper bounds on the crossing number
@@ Property / cites work: Improved upper bounds on the crossing number / rank @@
+Normal rank
@@ Property / cites work @@
+Topologically sweeping an arrangement
@@ Property / cites work: Topologically sweeping an arrangement / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for String Graphs and its Applications
+Normal rank
@@ Property / cites work @@
+Applications of a New Separator Theorem for String Graphs
+Normal rank
@@ Property / cites work @@
+Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
+Normal rank
@@ Property / cites work @@
+On the undecidability of finite planar graphs
@@ Property / cites work: On the undecidability of finite planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2766682
@@ Property / cites work: Q2766682 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Protrusion Replacement by Counting Equivalence Classes
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+The crossing number of K5,n
@@ Property / cites work: The crossing number of K5,n / rank @@
+Normal rank
@@ Property / cites work @@
+Near-Optimal Separators in String Graphs
@@ Property / cites work: Near-Optimal Separators in String Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Square roots of minor closed graph classes
@@ Property / cites work: Square roots of minor closed graph classes / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal planarization of nonplanar graphs
@@ Property / cites work: On maximal planarization of nonplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Better Bound for the Pair-Crossing Number
@@ Property / cites work: A Better Bound for the Pair-Crossing Number / rank @@
+Normal rank
@@ Property / cites work @@
+Planar decompositions and the crossing number of graphs with an excluded minor
+Normal rank
@@ Property / cites work @@
+On a problem of P. Turan concerning graphs
@@ Property / cites work: On a problem of P. Turan concerning graphs / rank @@
+Normal rank