Pach, János (2015) Every graph admits an unambiguous bold drawing. JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS, 19 (1). pp. 299-312. ISSN 1526-1719
|
Text
BoldDrawingLNCSreprint.pdf Download (149kB) | Preview |
Official URL: http://dx.doi.org/10.7155/jgaa.00359
Abstract
Let r and w be 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 [10] 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. © 2015, Brown University. All rights reserved.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 17 Feb 2016 13:35 |
| Last Modified: | 17 Feb 2016 13:35 |
| URI: | http://real.mtak.hu/id/eprint/33699 |
Actions (login required)
 |
Edit Item |
