ISGCI says that the chromatic number of a graph is upper bounded in terms of the book thickness. https://www.graphclasses.org/classes/par_32.html

This can be improved by saying that the book thickness bounds the degeneracy.

A further improvement would be that the book thickness bounds the acyclic chromatic number.

Is it true? Is there a reference?