Two graphs G and H with the same vertex set V are P4-isomorphic if every four vertices {a, b, c, d} ⊆ V induce a chordless path (denoted by P4) in G if and only if they induce a P4 in H. We call a graph split-perfect if it is P4-isomorphic to a split graph (i.e., a graph being partitionable into a clique and a stable set). This paper characterizes the new class of split-perfect graphs using the...
