We describe a family of graphs with queue-number at most 4 but unbounded stack-number. This resolves open problems of Heath, Leighton and Rosenberg (1992) and Blankenship and Oporowski (1999).

翻译：我们描述的是一组图表,其排队数最多为4个,但没有被封住的堆叠数,这解决了Heath、Leighton和Rosenberg(1992年)、Blankenship和Oporowski(1999年)等尚未解决的问题。