A long-standing question of the mutual relation between the stack and queue numbers of a graph, explicitly emphasized by Dujmovi\'c and Wood in 2005, was "half-answered" by Dujmovi\'c, Eppstein, Hickingbotham, Morin and Wood in 2022; they proved the existence of a graph family with the queue number at most 4 but unbounded stack number. We give an alternative very short, and still elementary, proof of the same fact.
@article{arxiv.2303.10116,
title = {Stack and Queue Numbers of Graphs Revisited},
author = {Petr Hliněný and Adam Straka},
journal= {arXiv preprint arXiv:2303.10116},
year = {2024}
}