Stack-number is not bounded by queue-number

DOI10.1007/S00493-021-4585-7MaRDI QIDQ6353279arXivFDO

Authors Vida Dujmović, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood

Publication date 9 November 2020

Published in arXiv

Full work available at URL https://doi.org/10.1007/S00493-021-4585-7

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

arXiv classification

cs.DM math.CO

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

This page was built for publication: Stack-number is not bounded by queue-number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6353279)