Pages that link to "Item:Q1174334"
From MaRDI portal
The following pages link to On the thickness of graphs of given degree (Q1174334):
Displaying 24 items.
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- A note on Halton's conjecture (Q707336) (← links)
- Remarks on the thickness and outerthickness of a graph (Q814092) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← links)
- Radial drawings of graphs: geometric constraints and trade-offs (Q954965) (← links)
- Drawing colored graphs on colored points (Q959802) (← links)
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Remarks on the thickness of a graph (Q1292575) (← links)
- The thickness of a minor-excluded class of graphs (Q1379835) (← links)
- A tribute to Frank Harary (in honor of his 70th birthday) (Q1388964) (← links)
- Geometric thickness in a grid (Q1417581) (← links)
- A genetic algorithm for determining the thickness of a graph (Q1602541) (← links)
- Sequential Monto Carlo techniques for the solution of linear systems (Q1891301) (← links)
- On upward point set embeddability (Q1947995) (← links)
- On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- The thickness of amalgamations and Cartesian product of graphs (Q2364079) (← links)
- Planarization and fragmentability of some classes of graphs (Q2427499) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS (Q3063657) (← links)
- Upward Point Set Embeddability for Convex Point Sets Is in P (Q3223972) (← links)
- Geometric Thickness in a Grid of Linear Area (Q3438999) (← links)
- Constrained Point Set Embedding of a Balanced Binary Tree (Q5261607) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
