Linear time recognition of P4-indifference graphs

Abstract

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

Keywords

• [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
• [info.info-dc] computer science [cs]/distributed, parallel, and cluster computing [cs.dc]
• [info.info-ni] computer science [cs]/networking and internet architecture [cs.ni]
• [info.info-wb] computer science [cs]/web