Linear time recognition of P4-indifference graphsArticle
Authors: Michel Habib 1; Christophe Paul 2; Laurent Viennot 3
0000-0002-8564-2314##0000-0001-6519-975X##NULL
Michel Habib;Christophe Paul;Laurent Viennot
1 Laboratoire d'informatique Algorithmique : Fondements et Applications
2 Algorithmes, Graphes et Combinatoire
3 High performance communication
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