Graphs that split entropies

Two graphs G and H with the same vertex set V are P₄-isomorphic if every four vertices {a,b,c,d} \subseteq V$ induce a chordless path (denoted by P₄) in G if and only if they induce a P₄ in H. We call a graph split-perfect if it is P₄-isomorphic to a ...

Two graphs G and H with the same vertex set V are P₄- isomorphic if every four vertices {a, b, c, d} ⊆ V induce a chordless path (denoted by P₄) in G if and only if they induce a P₄ in H. We call a graph split-perfect if it is P₄-isomorphic to a split ...

In the course of proving the strong perfect graph theorem, Chudnovsky, Robertson, Seymour, and Thomas showed that every perfect graph either belongs to one of five basic classes or admits one of several decompositions. Four of the basic classes are ...