Discrete Mathematics & Theoretical Computer Science (Dec 2001)
Linear time recognition of P 4-indifference graphs
Abstract
A graph is a P 4-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<b<c<d or d<c<b<a. We present a linear time recognition for these graphs.