Characterizations of cographs as intersection graphs of paths on a grid

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.