Slow Coloring of 3k-Connected Graphs

The slow coloring game was introduced by Mahoney, Puleo, and West and it is played by two players, Lister and Painter, on a graph $G$. In round $i$, Lister marks a nonempty subset $M$ of $V(G)$. By doing this he scores $|M|$ points. Painter responds by deleting a maximal independent subset of $M$. This process continues until all vertices are deleted. Lister aims to maximize the score, while Painter aims to minimize it. The best score that both players can guarantee is called the \textit{slow coloring number} or \textit{sum-color cost} of $G$, denoted $\spo{(G)}$. Puleo and West found that for an $n$-vertex tree $T$, the slow coloring number is at most $\lfloor \frac{3n}{2} \rfloor$, and that the maximum can be reached when $T$ contains a spanning forest with vertices of degree 1 or 3. This implies that every n-vertex graph $G$ having a perfect matching satisfies $\spo(G) \geq \lfloor{\frac{3n}{2}}\rfloor$. In this paper, we prove that for $3k$-connected graphs with $|V(G)| \geq 4k$ and with a perfect matching the lower bound is higher: $\spo(G) \geq \frac{3n}{2} + k$.