Lecture Notes in Computer Science Volume 1353, 1997, pp 359-370

Discrete realizations of contact and intersection graphs (extended abstract)

Purchase on Springer.com

$29.95 / €24.95 / £19.95*

* Final gross prices may vary according to local VAT.

Get Access


Known realizations of geometric representations of graphs, like contact, intersection, etc., are “continuous”, in the sense that the geometric objects are drawn in Euclidean space with real numbers as coordinates. In this paper, we initiate the study of dicrete versions of contact and intersection graphs and examine their relation to their continuous counterparts. The classes of graphs arising appear to have interesting properties and are thus interesting in their own right. We also study realizability, characterizations as well as intractability questions for the resulting new classes of graphs.