Pages that link to "Item:Q2387202"
From MaRDI portal
The following pages link to Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202):
Displaying 16 items.
- On the queue-number of graphs with bounded tree-width (Q521397) (← 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)
- Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202) (← links)
- Area requirement of graph drawings with few crossings per edge (Q2391538) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← 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)
- Equilateral Spherical Drawings of Planar Cayley Graphs (Q5144883) (← links)
- Planar Graphs of Bounded Degree Have Bounded Queue Number (Q5235482) (← links)
- Queue layouts of planar 3-trees (Q5918924) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- Tree-partitions with bounded degree trees (Q6630448) (← links)
- Product structure of graph classes with bounded treewidth (Q6632809) (← links)
