Pages that link to "Item:Q4511256"
From MaRDI portal
The following pages link to Geometric Thickness of Complete Graphs (Q4511256):
Displaying 26 items.
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
- Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs (Q691765) (← links)
- Bounds on the crossing resolution of complete geometric graphs (Q765347) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- On \(k\)-planar crossing numbers (Q885282) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Geometric thickness in a grid (Q1417581) (← links)
- Geometric biplane graphs. I: Maximal graphs (Q2345511) (← links)
- Graph drawings with few slopes (Q2385698) (← links)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Extension of a theorem of Whitney (Q2470340) (← links)
- Partitions of complete geometric graphs into plane trees (Q2489020) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- Drawing Cubic Graphs with the Four Basic Slopes (Q3223959) (← links)
- Geometric Thickness in a Grid of Linear Area (Q3438999) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- Layouts of Expander Graphs (Q3466402) (← 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)
- Ideal spatial graph configurations (Q5047033) (← links)
- Planar projections of graphs (Q5896110) (← links)
- Straight-line drawings of 1-planar graphs (Q6049552) (← links)