TackLayouts2004
https://www.doi.org/10.46298/DMTCS.315
@article{TackLayouts2004,
author = {Vida Dujmovi{ć} and Attila P{ó}r and David R. Wood},
doi = {10.46298/DMTCS.315},
journaltitle = {Discret. Math. Theor. Comput. Sci.},
number = {2},
pages = {497--522},
title = {Track Layouts of Graphs},
volume = {6},
year = {2004},
}
- page 14 : book thickness $k$ upper bounds acyclic chromatic number by $2^{\mathcal O(k)}$ – Theorem 5. Acyclic chromatic number is bounded by stack-number (ed: a.k.a. book-thickness). In particular, every $k$-stack graph $G$ has acyclich chromatic number $\chi_a(G) \le 80^{k(2k-1)}$.