Every Graph Admits an Unambiguous Bold Drawing
Pach, János (2012) Every Graph Admits an Unambiguous Bold Drawing. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 332-342 (Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_32).
Full text not available from this repository.
Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a bold drawing in which the region occupied by the union of the disks and rectangles representing the vertices and edges does not contain any disk of radius r other than the ones representing the vertices.
Repository Staff Only: item control page