23 search results - page 1 / 5 » Separating Thickness from Geometric Thickness |
CORR
2002
Springer
13 years 11 months ago
2002
Springer
COMBINATORICS
2006
13 years 11 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
CCCG
2009
14 years 8 days ago
2009
We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...
GD
1998
Springer
14 years 3 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...
ICPR
2002
IEEE
15 years 7 days ago
2002
IEEE
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...