Layout of Graphs with Bounded Tree-Width
From MaRDI portal
Recommendations
Cited in
(66)- Volume requirements of 3D upward drawings
- On tree-partition-width
- Width-restricted layering of acyclic digraphs with consideration of dummy nodes
- Local and union boxicity
- Track layouts, layered path decompositions, and leveled planarity
- Acyclic colorings of graph subdivisions revisited
- Stack-number is not bounded by queue-number
- On the queue number of planar graphs
- On acyclically 4-colorable maximal planar graphs
- An improved upper bound on the queue number of the hypercube
- Computing straight-line 3D grid drawings of graphs in linear volume
- Layered separators in minor-closed graph classes with applications
- Upward three-dimensional grid drawings of graphs
- Acyclic coloring of graphs with maximum degree 7
- An improved upper bound on the queue number of planar graphs
- Outer 1-planar graphs
- Topological graph layouts into a triangular prism
- Drawing Graphs on Few Lines and Few Planes
- Track layout is hard
- Parameters tied to treewidth
- Layouts of Expander Graphs
- Acyclic coloring with few division vertices
- Crossings in grid drawings
- scientific article; zbMATH DE number 1954397 (Why is no real title available?)
- scientific article; zbMATH DE number 1974106 (Why is no real title available?)
- Graph layouts via layered separators
- The Local Queue Number of Graphs with Bounded Treewidth
- Parameterized Algorithms for Queue Layouts
- Parameterized algorithms for queue layouts
- Improved bounds for track numbers of planar graphs
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- Two results on layered pathwidth and linear layouts
- Improved bounds for centered colorings
- Graph Drawing
- On the queue-number of graphs with bounded tree-width
- Treewidth of display graphs: bounds, brambles and applications
- Planar graphs of bounded degree have bounded queue number
- (3,2)-Track Layout of Bipartite Graph Subdivisions
- Tree-partitions of k-trees with applications in graph layout.
- Queue layouts of planar 3-trees
- Queue layouts of planar 3-trees
- On the upward book thickness problem: combinatorial and complexity results
- Acyclic 3-coloring of generalized Petersen graphs
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- Linear layouts of bipartite planar graphs
- 2-Layer Graph Drawings with Bounded Pathwidth
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs
- Characterisations and examples of graph classes with bounded expansion
- Tree-partitions with bounded degree trees
- Product structure of graph classes with bounded treewidth
- Directed acyclic outerplanar graphs have constant stack number
- An improved upper bound on the queue number of the folded hypercube
- Product structure of graph classes with strongly sublinear separators
- Acyclically 3-colorable planar graphs
- Queue layouts on folded hypercubes
- On the parameterized complexity of computing tree-partitions
- On the parameterized complexity of computing tree-partitions
- Transforming stacks into queues: mixed and separated layouts of graphs
- An overview of universal obstructions for graph parameters
- Linear layouts of graphs with priority queues
- Linear layouts revisited: stacks, queues, and exact algorithms
- Queue layouts of iterated line directed graphs
- Graph parameters measuring neighbourhoods in graphs-bounds and applications
- On the parameterized complexity of layered graph drawing
- A new upper bound on the queuenumber of hypercubes
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
This page was built for publication: Layout of Graphs with Bounded Tree-Width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317164)
