SIAMDM
2010
12 years 11 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
COMGEO
2007
ACM
13 years 4 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
GD
1998
Springer
13 years 8 months ago
1998
Springer
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...