Borodin-Kostochka conjecture and Partitioning a graph into classes with no clique of specified size

Yaser Rowshan

For a given graph $H$ and the graphical properties $P_1,P_2,\dots ,P_k$, a graph $H$ is said to be $(V_1,V_2,\dots ,V_k)$-partitionable if there exists a partition of $V(H)$ into…