Pages that link to "Item:Q2583678"
From MaRDI portal
The following pages link to Bounded-degree graphs have arbitrarily large geometric thickness (Q2583678):
Displaying 27 items.
- The planar slope number of planar partial 3-trees of bounded degree (Q354442) (← links)
- Crossings in grid drawings (Q405129) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
- Bounds on the crossing resolution of complete geometric graphs (Q765347) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
- Geometric representation of cubic graphs with four directions (Q833706) (← links)
- Drawing subcubic planar graphs with four slopes and optimal angular resolution (Q1694729) (← links)
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles (Q1725748) (← links)
- On dispersability of some products of cycles (Q2116698) (← links)
- Graph drawings with few slopes (Q2385698) (← links)
- Drawings of planar graphs with few slopes and segments (Q2385699) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- Outerplanar graph drawings with few slopes (Q2444313) (← links)
- Drawing cubic graphs with at most five slopes (Q2483558) (← links)
- Bounded-degree graphs can have arbitrarily large slope numbers (Q2583679) (← links)
- Drawing partial 2-trees with few slopes (Q2701381) (← links)
- Drawing Cubic Graphs with the Four Basic Slopes (Q3223959) (← links)
- Cubic Graphs Have Bounded Slope Parameter (Q3611836) (← links)
- Relating Graph Thickness to Planar Layers and Bend Complexity (Q4556953) (← links)
- Angular Resolutions: Around Vertices and Crossings (Q5001662) (← links)
- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles (Q5144877) (← links)
- Planar projections of graphs (Q5896110) (← links)
- On dispersable book embeddings (Q5915585) (← links)
- Level-planar drawings with few slopes (Q5918472) (← links)
- Level-planar drawings with few slopes (Q5918990) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q6586655) (← links)
