Structural domination and coloring of some ($P_7,C_7$)-free graphs

S. A. Choudum, T. Karthick, Manoj M. Belavadi

We show that every connected induced subgraph of a graph $G$ is dominated by an induced connected split graph if and only if $G$ is $\mathcal{C}$-free, where $\mathcal{C}$ is a set of six…