Pages that link to "Item:Q679741"

The following pages link to Thickness and colorability of geometric graphs (Q679741):

Displaying 12 items.

• On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
• The thickness and chromatic number of \(r\)-inflated graphs (Q709322) (← links)
• Geometric thickness in a grid (Q1417581) (← links)
• A genetic algorithm for determining the thickness of a graph (Q1602541) (← links)
• 3-coloring arrangements of line segments with 4 slopes is hard (Q1641160) (← links)
• On representations of some thickness-two graphs (Q1961382) (← links)
• Geometric Thickness of Complete Graphs (Q4511256) (← links)
• Relating Graph Thickness to Planar Layers and Bend Complexity (Q4556953) (← links)
• The geometric thickness of low degree graphs (Q5361688) (← links)
• On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
• Planar projections of graphs (Q5896110) (← links)
• Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete (Q6547943) (← links)