Characterizations of cographs as intersection graphs of paths on a grid

Elad Cohen, Martin Charles Golumbic, Bernard Ries

Research output: Contribution to journalArticlepeer-review


A cograph is a graph which does not contain any induced path on four vertices. In this paper, we characterize those cographs that are intersection graphs of paths on a grid in the following two cases: (i) the paths on the grid all have at most one bend and the intersections concern edges (→ B1-EPG); (ii) the paths on the grid are not bended and the intersections concern vertices (→ B0-VPG). In both cases, we give a characterization by a family of forbidden induced subgraphs. We further present linear-time algorithms to recognize B1-EPG cographs and B0-VPG cographs using their cotree.

Original languageEnglish
Pages (from-to)46-57
Number of pages12
JournalDiscrete Applied Mathematics
StatePublished - 11 Dec 2014

Bibliographical note

Publisher Copyright:
© 2014 Elsevier Ltd. All rights reserved.


  • Cograph
  • Cotree
  • Grid
  • Induced subgraph
  • Intersection graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Characterizations of cographs as intersection graphs of paths on a grid'. Together they form a unique fingerprint.

Cite this