Treewidth, Circle Graphs, and Circular Drawings (Q6195956): Difference between revisions

@@ Property / cites work @@
+On the tree-width of even-hole-free graphs
@@ Property / cites work: On the tree-width of even-hole-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs
+Normal rank
@@ Property / cites work @@
+Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree
+Normal rank
@@ Property / cites work @@
+Gap-planar graphs
@@ Property / cites work: Gap-planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The book thickness of 1-planar graphs is constant
@@ Property / cites work: The book thickness of 1-planar graphs is constant / rank @@
+Normal rank
@@ Property / cites work @@
+Four pages are indeed necessary for planar graphs
@@ Property / cites work: Four pages are indeed necessary for planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Isotropic systems
@@ Property / cites work: Isotropic systems / rank @@
+Normal rank
@@ Property / cites work @@
+Graphic presentations of isotropic systems
@@ Property / cites work: Graphic presentations of isotropic systems / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds for colouring circle graphs
@@ Property / cites work: Improved bounds for colouring circle graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Circle graphs are quadratically χ‐bounded
@@ Property / cites work: Circle graphs are quadratically χ‐bounded / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of circle graphs
@@ Property / cites work: A characterization of circle graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some results on tree decomposition of graphs
@@ Property / cites work: Some results on tree decomposition of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Stack-number is not bounded by queue-number
@@ Property / cites work: Stack-number is not bounded by queue-number / rank @@
+Normal rank
@@ Property / cites work @@
+Structure of Graphs with Locally Restricted Crossings
+Normal rank
@@ Property / cites work @@
+Layered separators in minor-closed graph classes with applications
+Normal rank
@@ Property / cites work @@
+Graph product structure for non-minor-closed classes
+Normal rank
@@ Property / cites work @@
+Graph treewidth and geometric thickness parameters
+Normal rank
@@ Property / cites work @@
+Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+Improved Circular Layouts
@@ Property / cites work: Improved Circular Layouts / rank @@
+Normal rank
@@ Property / cites work @@
+The grid theorem for vertex-minors
@@ Property / cites work: The grid theorem for vertex-minors / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for graphs embeddable with few crossings per edge
+Normal rank
@@ Property / cites work @@
+On the chromatic number of multiple interval graphs and overlap graphs
+Normal rank
@@ Property / cites work @@
+On the thickness of graphs of given degree
@@ Property / cites work: On the thickness of graphs of given degree / rank @@
+Normal rank
@@ Property / cites work @@
+Parameters Tied to Treewidth
@@ Property / cites work: Parameters Tied to Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Induced subgraphs and path decompositions
@@ Property / cites work: Induced subgraphs and path decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Q5590660
@@ Property / cites work: Q5590660 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree densities in sparse graph classes
@@ Property / cites work: Tree densities in sparse graph classes / rank @@
+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 @@
+TREEWIDTH OF CIRCLE GRAPHS
@@ Property / cites work: TREEWIDTH OF CIRCLE GRAPHS / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing crossings in constrained two-sided circular graph layouts.
+Normal rank
@@ Property / cites work @@
+Grid induced minor theorem for graphs of small degree
+Normal rank
@@ Property / cites work @@
+Covering and coloring polygon-circle graphs
@@ Property / cites work: Covering and coloring polygon-circle graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-width dichotomy
@@ Property / cites work: Tree-width dichotomy / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphieeigenschaften und mittlere Kantendichte von Graphen
+Normal rank
@@ Property / cites work @@
+Homomorphiesätze für Graphen
@@ Property / cites work: Homomorphiesätze für Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+The thickness of graphs: A survey
@@ Property / cites work: The thickness of graphs: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Rank-width and vertex-minors
@@ Property / cites work: Rank-width and vertex-minors / rank @@
+Normal rank
@@ Property / cites work @@
+Rank-width: algorithmic and structural results
@@ Property / cites work: Rank-width: algorithmic and structural results / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs drawn with few crossings per edge
@@ Property / cites work: Graphs drawn with few crossings per edge / rank @@
+Normal rank
@@ Property / cites work @@
+Which crossing number is it anyway?
@@ Property / cites work: Which crossing number is it anyway? / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding planar graphs at fixed vertex locations
@@ Property / cites work: Embedding planar graphs at fixed vertex locations / rank @@
+Normal rank
@@ Property / cites work @@
+(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth
+Normal rank
@@ Property / cites work @@
+Q4407447
@@ Property / cites work: Q4407447 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Numbers of Graphs
@@ Property / cites work: Crossing Numbers of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The graph crossing number and its variants: a survey
+Normal rank
@@ Property / cites work @@
+A survey of χ‐boundedness
@@ Property / cites work: A survey of χ‐boundedness / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for Convex Crossing Numbers
@@ Property / cites work: Bounds for Convex Crossing Numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4657594
@@ Property / cites work: Q4657594 / rank @@
+Normal rank
@@ Property / cites work @@
+(Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
+Normal rank
@@ Property / cites work @@
+A successful concept for measuring non-planarity of graphs: The crossing number.
+Normal rank
@@ Property / cites work @@
+Q5735733
@@ Property / cites work: Q5735733 / rank @@
+Normal rank
@@ Property / cites work @@
+On tree-partition-width
@@ Property / cites work: On tree-partition-width / rank @@
+Normal rank
@@ Property / cites work @@
+Planar decompositions and the crossing number of graphs with an excluded minor
+Normal rank
@@ Property / cites work @@
+Embedding planar graphs in four pages
@@ Property / cites work: Embedding planar graphs in four pages / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs that need four pages
@@ Property / cites work: Planar graphs that need four pages / rank @@
+Normal rank