In this paper we give an overview of the graph invariants queue number and stack number (the latter also called the page number or book thickness). Due to their similarity, it has been studied for a long time, whether one of them is bounded in terms of the other. It is now known that the stack number is not bounded by the queue number. We present a simplified proof of this result. We also survey the known results about possible stack number bound on the queue number. This preprint is a rework of the bachelor thesis [29].

翻译：本文概述了图的栈数（亦称页数或书厚度）与队列数这两个图论不变量。由于两者具有相似性，长期以来研究者一直在探讨其中一个是否受限于另一个。目前已证明栈数不受队列数限制，我们给出了这一结论的简化证明。此外，本文综述了队列数可能受栈数限制的相关已知结果。本预印本是对学士学位论文[29]的重新整理。