Orthogonal Tree Decompositions of Graphs (Q4634649): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05639
@@ Property / arXiv ID: 1701.05639 / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Nonplanar Graphs
@@ Property / cites work: A Separator Theorem for Nonplanar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On a Coloring Problem.
@@ Property / cites work: On a Coloring Problem. / rank @@
+Normal rank
@@ Property / cites work @@
+Track layouts, layered path decompositions, and leveled planarity
+Normal rank
@@ Property / cites work @@
+Separating tree-chromatic number from path-chromatic number
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q3836521
@@ Property / cites work: Q3836521 / rank @@
+Normal rank
@@ Property / cites work @@
+Domino Treewidth
@@ Property / cites work: Domino Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q3726125
@@ Property / cites work: Q3726125 / rank @@
+Normal rank
@@ Property / cites work @@
+Helly families of maximal size
@@ Property / cites work: Helly families of maximal size / rank @@
+Normal rank
@@ Property / cites work @@
+Boxicity and treewidth
@@ Property / cites work: Boxicity and treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Independent Sets in Map Graphs
+Normal rank
@@ Property / cites work @@
+New bounds on the edge number of ak-map graph
@@ Property / cites work: New bounds on the edge number of ak-map graph / rank @@
+Normal rank
@@ Property / cites work @@
+Map graphs
@@ Property / cites work: Map graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Bidimensional Parameters and Local Treewidth
@@ Property / cites work: Bidimensional Parameters and Local Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+Q5501346
@@ Property / cites work: Q5501346 / rank @@
+Normal rank
@@ Property / cites work @@
+Excluding any graph as a minor allows a low tree-width 2-coloring
+Normal rank
@@ Property / cites work @@
+Crossing Numbers and Cutwidths
@@ Property / cites work: Crossing Numbers and Cutwidths / rank @@
+Normal rank
@@ Property / cites work @@
+Structure of Graphs with Locally Restricted Crossings
+Normal rank
@@ Property / cites work @@
+Stack and Queue Layouts via Layered Separators
@@ Property / cites work: Stack and Queue Layouts via Layered Separators / rank @@
+Normal rank
@@ Property / cites work @@
+Layered separators in minor-closed graph classes with applications
+Normal rank
@@ Property / cites work @@
+Treewidth of graphs with balanced separations
@@ Property / cites work: Treewidth of graphs with balanced separations / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly Sublinear Separators and Polynomial Expansion
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+Q5786239
@@ Property / cites work: Q5786239 / rank @@
+Normal rank
@@ Property / cites work @@
+Burling graphs, chromatic number, and orthogonal tree-decompositions
+Normal rank
@@ Property / cites work @@
+Q5743499
@@ Property / cites work: Q5743499 / rank @@
+Normal rank
@@ Property / cites work @@
+Separator theorems and Turán-type results for planar intersection graphs
+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 @@
+Local tree-width, excluded minors, and approximation algorithms
+Normal rank
@@ Property / cites work @@
+On tree width, bramble size, and expansion
@@ Property / cites work: On tree width, bramble size, and expansion / rank @@
+Normal rank
@@ Property / cites work @@
+Parameters Tied to Treewidth
@@ Property / cites work: Parameters Tied to Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828516
@@ Property / cites work: Q4828516 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number<sup>*</sup>
+Normal rank
@@ Property / cites work @@
+Complete graph minors and the graph minor structure theorem
+Normal rank
@@ Property / cites work @@
+String graphs. II: Recognizing string graphs is NP-hard
+Normal rank
@@ Property / cites work @@
+Separators in region intersection graphs
@@ Property / cites work: Separators in region intersection graphs / 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 @@
+String graphs and separators
@@ Property / cites work: String graphs and separators / rank @@
+Normal rank
@@ Property / cites work @@
+On the chordality of a graph
@@ Property / cites work: On the chordality of a graph / 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 @@
+New tools and results in graph minor structure theory
+Normal rank
@@ Property / cites work @@
+Applications of the crossing number
@@ Property / cites work: Applications of the crossing number / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing string graphs is decidable
@@ Property / cites work: Recognizing string graphs is decidable / rank @@
+Normal rank
@@ Property / cites work @@
+Q4352948
@@ Property / cites work: Q4352948 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Graph minors. XVI: Excluding a non-planar graph
@@ Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+The graph crossing number and its variants: a survey
+Normal rank
@@ Property / cites work @@
+Recognizing string graphs in NP
@@ Property / cites work: Recognizing string graphs in NP / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of string graphs
@@ Property / cites work: Decidability of string graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-chromatic number
@@ Property / cites work: Tree-chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+On VLSI layouts of the star graph and related networks
+Normal rank
@@ Property / cites work @@
+Interval representations of planar graphs
@@ Property / cites work: Interval representations of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On tree-partition-width
@@ Property / cites work: On tree-partition-width / rank @@
+Normal rank