Before revision:  As an example of this reverse scheme, we present a polynomial-time algorithm that properly colors the vertices of a graph with relatively few colors, establishing that bounded twin-width classes are \chi-bounded.
After revision:  As an example , we establish that bounded twin-width classes are \chi-bounded.