Cohen, Elad Golumbic, Martin Charles Ries, Bernard 2014 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,wegive 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. application/pdf https://folia.unifr.ch/global/documents/308613 https://folia.unifr.ch/documents/308613/files/epg.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2014.06.020 info:eu-repo/semantics/openAccess License undefined Discrete Applied Mathematics. - 2014, vol. 178, p. 46-57 digraph cotter grid intersection graph induced subgraph info:eu-repo/classification/udc/004 Characterizations of cographs as intersection graphs of paths on a grid http://purl.org/coar/resource_type/c_6501