2 problems

Let $H$ be a graph, let $\Delta(H)$ denote its maximum degree, and let $schi(H)$ denote its strong chromatic number, the minimum number of colors needed so that every graph formed b…

Let $G$ be a vertex-transitive graph with maximum degree $\Delta$, and let $s\chi(G)$ denote its strong chromatic number, the smallest $r$ such that every partition of $V(G)$ into…