Connected greedy coloring $H$-free graphs

A connected ordering $(v1, v2, \ldots, vn)$ of $V(G)$ is an ordering of the vertices such that $vi$ has at least one neighbour in ${v1, \ldots, v{i - 1}}$ for every $i \in {2, \ldots, n}$. A connected greedy coloring (CGC for short) is a coloring obtained by applying the greedy algorithm to a connected ordering. This has been first introduced in 1989 by Hertz and de Werra, but still very little is known about this problem. An interesting aspect is that, contrary to the traditional greedy coloring, it is not always true that a graph has a connected ordering that produces an optimal coloring; this motivates the definition of the connected chromatic number of $G$, which is the smallest value $\chic(G)$ such that there exists a CGC of $G$ with $\chic(G)$ colors. An even more interesting fact is that $\chic(G) \le \chi(G)+1$ for every graph $G$ (Benevides et. al. 2014). In this paper, in the light of the dichotomy for the coloring problem restricted to $H$-free graphs given by Kr\'al et.al. in 2001, we are interested in investigating the problems of, given an $H$-free graph $G$: (1). deciding whether $\chic(G)=\chi(G)$; and (2). given also a positive integer $k$, deciding whether $\chic(G)\le k$. We have proved that Problem (2) has the same dichotomy as the coloring problem (i.e., it is polynomial when $H$ is an induced subgraph of $P4$ or of $P3+K1$, and it is NP-complete otherwise). As for Problem (1), we have proved that $\chic(G) = \chi(G)$ always hold when $G$ is an induced subgraph of $P5$ or of $P4+K1$, and that it is NP-hard to decide whether $\chic(G)=\chi(G)$ when $H$ is not a linear forest or contains an induced $P9$. We mention that some of the results actually involve fixed $k$ and fixed $\chi(G)$.