A fast algorithm for the product structure of planar graphs (Q2663717): Difference between revisions

@@ Property / cites work @@
+Nonrepetitive colorings of graphs
@@ Property / cites work: Nonrepetitive colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds for centered colorings
@@ Property / cites work: Improved bounds for centered colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory
@@ Property / cites work: Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs have bounded nonrepetitive chromatic number
+Normal rank
@@ Property / cites work @@
+Planar Graphs Have Bounded Queue-Number
@@ Property / cites work: Planar Graphs Have Bounded Queue-Number / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Algorithms for graphs embeddable with few crossings per edge
+Normal rank
@@ Property / cites work @@
+Comparing Queues and Stacks As Machines for Laying Out Graphs
+Normal rank
@@ Property / cites work @@
+Implicat Representation of Graphs
@@ Property / cites work: Implicat Representation of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+Grad and classes with bounded expansion. I: Decompositions
+Normal rank
@@ Property / cites work @@
+Polynomial bounds for centered colorings on proper minor-closed graph classes
+Normal rank