当前位置：
X-MOL 学术
›
Combinatorica
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Stack-Number is Not Bounded by Queue-Number
Combinatorica ( IF 1.0 ) Pub Date : 2021-08-31 , DOI: 10.1007/s00493-021-4585-7 Vida Dujmović 1 , David Eppstein 2 , Robert Hickingbotham 3 , David R. Wood 3 , Pat Morin 4
中文翻译：
堆栈号不受队列号限制
更新日期：2021-09-01
Combinatorica ( IF 1.0 ) Pub Date : 2021-08-31 , DOI: 10.1007/s00493-021-4585-7 Vida Dujmović 1 , David Eppstein 2 , Robert Hickingbotham 3 , David R. Wood 3 , Pat Morin 4
Affiliation
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）的开放问题。
京公网安备 11010802027423号