Clique spectral extremal problem on disjoint color-critical graphs

Changjiang Bu, Peiyan Wei, Haotian Zeng

For a given graph $F$, a graph $G$ is called $F$-free if it does not contain $F$ as a subgraph. A graph is color-critical if deleting one of its edges decreases its chromatic numbe…