A solution to a conjecture on the signless Laplacian spectral radius for $t$-color-critical graphs

Ming-Zhu Chen, Ya-Lei Jin, Peng-Li Zhang +1

An induced matching is a matching that forms an induced subgraph. A graph is $t$-color-critical if removing some induced matching of size $t$ lowers its chromatic number, but remov…