The A-tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with “few” induced P4 s. In this paper, we extend to PA-tidy graphs a linear time algorithm of C.-H.… (More)

The P4 -tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with few induced P4 (cographs, P4 -sparse graphs, P4 -lite graphs). Here, we propose an extension of… (More)

Following Maire (Graphs Combin. 10 (3) (1994) 263) we call a loose vertex a vertex whose neighbourhood induces a P4-free graph, and we show that every C4-free Berge graph G which is not a clique… (More)