On the Recognition of P4-Indifferent Graphs

Rizzi, Romeo (2001) On the Recognition of P4-Indifferent Graphs. UNSPECIFIED.

Download (315Kb) | Preview


    A simple graph is P_4-indifferent if it admits a total order < on its nodes such that every chordless path with nodes a,b,c,d and edges ab,bc,cd has a<b<c<d or a>b>c>d. P_4-indifferent graphs generalize indifferent graphs and are perfectly orderable. Recently, Hoang, Maffray and Noy gave a characterization of P_4-indifferent graphs in terms of forbidden induced subgraphs. We clarify their proof and describe a linear time algorithm to recognize P_4-indifferent graphs. When the input is a P_4-indifferent graph, then the algorithm computes an order < as above.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Uncontrolled Keywords: P_4-indifference, linear time, recognition, modular decomposition
    Additional Information: Published in: "Discrete Mathematics" 239 (2001) 161--169
    Report Number: DIT-02-051
    Repository staff approval on: 21 Jan 2003

    Actions (login required)

    View Item