On grid intersection graphs

I. Ben Arroyo Hartman, Ilan Newman, Ran Ziv

Research output: Contribution to journalArticlepeer-review


A bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of horizontal and vertical segments in the plane, respectively, such that (xi, yj) ∈ E if and only if segments xi and yj intersect. We prove that all planar bipartite graphs have a grid representation, and exhibit some infinite families of graphs with no grid representation-among them the point line incidence graph of projective planes.

Original languageEnglish
Pages (from-to)41-52
Number of pages12
JournalDiscrete Mathematics
Issue number1
StatePublished - 19 Jan 1991
Externally publishedYes

Bibliographical note

Funding Information:
* The research was done while the author was in the Mathematics Department, Technion, Israel, and the Computer Science Department, University of Toronto, Toronto, Canada. ** Supported by Technion V.P.R. Fund and New York Metropolitan research fund. *** The research was done while the author was in the Computer Science Department, Haifa, Israel.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'On grid intersection graphs'. Together they form a unique fingerprint.

Cite this