Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...

Vertices arrive sequentially in space and are joined to existing vertices at random according to a preferential rule combining degree and spatial proximity. We investigate phase transitions in the ...

In this paper we study the treewidth of the random geometric graph, obtained by dropping n points onto the square [0, √n]² and connecting pairs of points by an edge if their distance is at most r = ...