Abstract
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.
Reference12 articles.
1. Gail Adele Atneosen. On the embeddability of compacta in n-books: intrinsic and extrinsic properties. Michigan State University, 1968.
2. Vida Dujmović, David Eppstein, Robert Hickingbotham, Pat Morin, and David R. Wood. Stack-number is not bounded by queue-number. Combinatorica, 42(2):151-164, 2022.
3. Vida Dujmović and David R Wood. Stacks, queues and tracks: Layouts of graph subdivisions. Discrete Mathematics and Theoretical Computer Science, 7:155-202, 2005.
4. Pál Erdös and G. Szekeres. A combinatorial problem in geometry. Compositio Mathematica, 2:463-470, 1935.
5. David Gale. The game of hex and the Brouwer fixed-point theorem. The American Mathematical Monthly, 86(10):818-827, 1979.