Loading...
conference paper
Every graph admits an unambiguous bold drawing
2011
Graph Drawing. GD 2011
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.
Type
conference paper
Web of Science ID
WOS:000307210800031
Authors
Publication date
2011
Publisher
Published in
Graph Drawing. GD 2011
ISBN of the book
978-3-642-25877-0
Publisher place
Berlin
Total of pages
11
Series title/Series vol.
Lecture Notes in Computer Science; 7034
Start page
332
End page
342
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Eindhoven, Netherlands | September 21-23, 2011 | |
Available on Infoscience
December 12, 2011
Use this identifier to reference this record