Every graph admits an unambiguous bold drawing

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.

[1]  Stephen G. Kobourov,et al.  Drawing with Fat Edges , 2006, Int. J. Found. Comput. Sci..

[2]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[3]  Michael T. Goodrich,et al.  Drawing Planar Graphs with Large Vertices and Thick Edges , 2004, J. Graph Algorithms Appl..

[4]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1989, Discret. Comput. Geom..

[5]  Ramsey Theory,et al.  Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.

[6]  Stephen G. Kobourov,et al.  Drawing with Fat Edges , 2001, Graph Drawing.

[7]  Marc J. van Kreveld.  Bold Graph Drawings , 2009, CCCG.

[8]  Ketan Mulmuley.  A Fast Planar Partition Algorithm, I , 1990, J. Symb. Comput..

[9]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .