Pages that link to "Item:Q1121907"
From MaRDI portal
The following pages link to On the thickness and arboricity of a graph (Q1121907):
Displayed 10 items.
- Remarks on the thickness and outerthickness of a graph (Q814092) (← links)
- Remarks on the thickness of a graph (Q1292575) (← links)
- \(k\)-connectivity and decomposition of graphs into forests (Q1343147) (← links)
- The thickness of a minor-excluded class of graphs (Q1379835) (← links)
- Geometric thickness in a grid (Q1417581) (← links)
- A genetic algorithm for determining the thickness of a graph (Q1602541) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- Geometric Thickness in a Grid of Linear Area (Q3438999) (← links)
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method (Q3608305) (← links)
- A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415) (← links)