2 problems

Caro–Petru1evski–skrekovski's conjecture. For every connected graph $G$ of maximum degree $\Delta\geq 3$,

Caro and Yuster's conjecture. For every integer $k$ at least $2$, there is a constant $c_k$ such that