3 citations · 5 across the 16 of their papers we have counts for
1 paper · 1 filter
Imed Zaguia
We give a necessary and sufficient condition for a P4-free graph to be a cograph. This allows us to obtain a simple proof of the fact that finite P4-free graphs are finite co…