Stack-number is not bounded by queue-number

Abstract

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).

References in corpus (2)

• Book Embeddings of Graph Products
• Graph product structure for non-minor-closed classes

Cited by in corpus (1)

• Homomorphism counts in robustly sparse graphs