Pages that link to "Item:Q1121907"

The following pages link to On the thickness and arboricity of a graph (Q1121907):

Displaying 23 items.

• An annotated bibliography on the thickness, outerthickness, and arboricity of a graph (Q263943) (← links)
• On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
• 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)
• On the planar split thickness of graphs (Q1742373) (← links)
• The thickness of amalgamations and Cartesian product of graphs (Q2364079) (← links)
• Regularity of symbolic powers and arboricity of matroids (Q2418036) (← 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)
• (Q3808130) (← links)
• Thickness and Antithickness of Graphs (Q4626298) (← links)
• A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415) (← links)
• (Q5381563) (← links)
• On the book thickness of $k$-trees (Q5403004) (← links)
• Thickness and connectivity in graphs (Q5548827) (← links)
• Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules (Q6041828) (← links)
• Interval colorings of graphs—Coordinated and unstable no‐wait schedules (Q6084715) (← links)
• A note on interval colourings of graphs (Q6568831) (← links)