%0 Report %T Linear Time Recognition of P4-Indifference Graphs %+ High performance communication (HIPERCOM) %A Habib, Michel %A Paul, Christophe %A Viennot, Laurent %N RR-3779 %I INRIA %8 1999 %D 1999 %K P4-INDIFFERENCE %K ALGORITHM %K RECOGNITION %Z Computer Science [cs]/Other [cs.OH]Reports %X 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 %G English %2 https://inria.hal.science/inria-00072882/document %2 https://inria.hal.science/inria-00072882/file/RR-3779.pdf %L inria-00072882 %U https://inria.hal.science/inria-00072882 %~ X %~ CNRS %~ INRIA %~ UNIV-PSUD %~ INRIA-ROCQ %~ INRIA-RRRT %~ INRIA-SACLAY %~ X-DEP %~ INRIA_TEST %~ TESTALAIN1 %~ INRIA2 %~ LARA %~ UNIV-PARIS-SACLAY %~ UNIV-PSUD-SACLAY