论文标题
堆栈数没有被排队数界
Stack-number is not bounded by queue-number
论文作者
论文摘要
我们描述了一个带有队列数的图形家庭，最多是4个但无限的堆栈数。这解决了Heath，Leighton和Rosenberg（1992）以及Blankenship和Oporowski（1999）的开放问题。
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).
