Characterizations of cographs as intersection graphs of paths on a grid

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Cohen, E., Golumbic, M. C., & Ries, B. (2014). Characterizations of cographs as intersection graphs of paths on a grid. Discrete Applied Mathematics, 178, 46–57. https://doi.org/10.1016/j.dam.2014.06.020

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free