Lecture Notes in Computer Science Volume 1027, 1996, pp 365-372

Grid intersection and box intersection graphs on surfaces

Purchase on Springer.com

$29.95 / €24.95 / £19.95*

* Final gross prices may vary according to local VAT.

Get Access

Abstract

As analogs to grid intersection graphs and rectangle intersection graphs in the plane, we consider grid intersection graphs, grid contact graphs and box intersection graphs on the other two euclidean surfaces — the annulus and the torus. Our first results concern the inclusions among these classes, and the main result is negative — there are bipartite box intersection graphs on annulus (torus), which are not grid intersection graphs on the particular surfaces (in contrast to the planar case, where the two classes are equal, cf. Bellantoni, Hartman, Przytycka, Whitesides: Grid intersection graphs and boxicity, Discrete Math. 114 (1993), 41–49). We also consider the question of computational complexity of recognizing these classes. Among other results, we show that recognition of grid intersection graphs on annulus and torus are both polynomial time solvable, provided orderings of both vertical and horizontal segments are specified.