Stack-Number is Not Bounded by Queue-Number.
| Autor: | Dujmović, Vida, Eppstein, David, Hickingbotham, Robert, Morin, Pat, Wood, David R. |
|---|---|
| Zdroj: | Combinatorica; Apr2022, Vol. 42 Issue 2, p151-164, 14p |
| Abstrakt: | 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). [ABSTRACT FROM AUTHOR] |
| Databáze: | Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink