A graph is a P4-indifference graph if it admits an ordering < on its vertices such that every chordless path with vertices a, b, c, d and edges ab, bc, cd has a
Discrete Mathematics & Theoretical Computer Science
(1), Christophe Paul (2), Laurent Viennot (3) (1), Christophe Paul (2), Laurent Viennot (3)