Connected greedy coloring $H$-free graphs

Esdras Mota, Ana Silva, Leonardo Sampaio

A connected ordering $(v_1,v_2,\dots ,v_n)$ of $V(G)$ is an ordering of the vertices such that $v_i$ has at least one neighbour in $\{v_1,\dots ,v_{i-1}\}$ for every $i \in…