The following pages link to (Q4667621):
Displaying 33 items.
- Crossings in grid drawings (Q405129) (← links)
- Graph layouts via layered separators (Q473100) (← 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)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Volume requirements of 3D upward drawings (Q1011762) (← links)
- The queue-number of posets of bounded width or height (Q1725753) (← links)
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- On the queue number of planar graphs (Q2151450) (← links)
- Line and plane cover numbers revisited (Q2206873) (← 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)
- An improved upper bound on the queue number of planar graphs (Q2684487) (← links)
- Topological Graph Layouts into a Triangular Prism (Q2958107) (← links)
- Track Layout Is Hard (Q2961541) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- Cubic Planar Graphs that cannot be Drawn on few Lines (Q5088962) (← links)
- Improved Bounds for Track Numbers of Planar Graphs (Q5119382) (← links)
- Two Results on Layered Pathwidth and Linear Layouts (Q5144880) (← links)
- Planar Graphs of Bounded Degree Have Bounded Queue Number (Q5235482) (← links)
- Queue layouts of planar 3-trees (Q5915942) (← links)
- Queue layouts of planar 3-trees (Q5918924) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5919105) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
- Queue layouts of two-dimensional posets (Q6117079) (← links)
- 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)
- Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete (Q6547943) (← links)
- On 3-coloring circle graphs (Q6560146) (← links)
- On 3-coloring circle graphs (Q6636987) (← links)
