The following pages link to The thickness of graphs: A survey (Q1385299):
Displayed 37 items.
- The complexity of the empire colouring problem (Q476435) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
- A note on Halton's conjecture (Q707336) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Three ways to cover a graph (Q898135) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Worst case analysis of a greedy algorithm for graph thickness (Q1007554) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- Geometric thickness in a grid (Q1417581) (← links)
- A genetic algorithm for determining the thickness of a graph (Q1602541) (← links)
- Note on \(k\)-planar crossing numbers (Q1699274) (← links)
- Local and union boxicity (Q1709530) (← links)
- Thickness and outerthickness for embedded graphs (Q1744754) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- The thickness of amalgamations and Cartesian product of graphs (Q2364079) (← links)
- The \(k\)-strong induced arboricity of a graph (Q2408964) (← links)
- The thickness of the complete multipartite graphs and the join of graphs (Q2410038) (← links)
- Planarization and fragmentability of some classes of graphs (Q2427499) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- Drawing Cubic Graphs with the Four Basic Slopes (Q3223959) (← links)
- Geometric Thickness in a Grid of Linear Area (Q3438999) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method (Q3608305) (← links)
- Cubic Graphs Have Bounded Slope Parameter (Q3611836) (← links)
- The 4-girth-thickness of the complete graph (Q4577870) (← links)
- A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415) (← links)
- The 6-girth-thickness of the complete graph (Q4956180) (← links)
- The thickness of the Kronecker product of graphs (Q4988856) (← links)
- The 4-girth-thickness of the complete multipartite graph (Q5009944) (← links)
- The Local Queue Number of Graphs with Bounded Treewidth (Q5014102) (← links)
- Defective and clustered choosability of sparse graphs (Q5222556) (← links)
- Planar projections of graphs (Q5896110) (← links)
- Straight-line drawings of 1-planar graphs (Q6049552) (← links)
- The thickness of fan-planar graphs is at most three (Q6172200) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)