Pages that link to "Item:Q5317164"
From MaRDI portal
The following pages link to Layout of Graphs with Bounded Tree-Width (Q5317164):
Displaying 49 items.
- Outer 1-planar graphs (Q289919) (← links)
- Acyclic coloring with few division vertices (Q396683) (← links)
- Crossings in grid drawings (Q405129) (← links)
- Graph layouts via layered separators (Q473100) (← links)
- On the queue-number of graphs with bounded tree-width (Q521397) (← links)
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs (Q629832) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- Queue layouts of iterated line directed graphs (Q885285) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- A new upper bound on the queuenumber of hypercubes (Q965977) (← links)
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes (Q990104) (← links)
- Volume requirements of 3D upward drawings (Q1011762) (← links)
- On tree-partition-width (Q1024321) (← links)
- Local and union boxicity (Q1709530) (← links)
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- Acyclic colorings of graph subdivisions revisited (Q1932357) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- On the queue number of planar graphs (Q2151450) (← links)
- On acyclically 4-colorable maximal planar graphs (Q2318233) (← links)
- An improved upper bound on the queue number of the hypercube (Q2379994) (← links)
- Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- Acyclic coloring of graphs with maximum degree 7 (Q2657099) (← links)
- An improved upper bound on the queue number of planar graphs (Q2684487) (← links)
- Topological Graph Layouts into a Triangular Prism (Q2958107) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- Track Layout Is Hard (Q2961541) (← links)
- Stack and Queue Layouts via Layered Separators (Q2961542) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- The Local Queue Number of Graphs with Bounded Treewidth (Q5014102) (← links)
- Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
- Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
- Improved Bounds for Track Numbers of Planar Graphs (Q5119382) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Two Results on Layered Pathwidth and Linear Layouts (Q5144880) (← links)
- Improved Bounds for Centered Colorings (Q5162872) (← links)
- Planar Graphs of Bounded Degree Have Bounded Queue Number (Q5235482) (← links)
- (3,2)-Track Layout of Bipartite Graph Subdivisions (Q5302747) (← links)
- Queue layouts of planar 3-trees (Q5915942) (← links)
- Queue layouts of planar 3-trees (Q5918924) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- Acyclic 3-coloring of generalized Petersen graphs (Q5963660) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)
- Tree-partitions with bounded degree trees (Q6630448) (← links)
- Product structure of graph classes with bounded treewidth (Q6632809) (← links)
