Stack and Queue Numbers of Graphs Revisited
From MaRDI portal
Publication:6429972
arXiv2303.10116MaRDI QIDQ6429972FDOQ6429972
Authors: Petr Hliněný, Adam Straka 
Publication date: 17 March 2023
Abstract: A long-standing question of the mutual relation between the stack and queue numbers of a graph, explicitly emphasized by Dujmovi'c and Wood in 2005, was "half-answered" by Dujmovi'c, Eppstein, Hickingbotham, Morin and Wood in 2022; they proved the existence of a graph family with the queue number at most 4 but unbounded stack number. We give an alternative very short, and still elementary, proof of the same fact.
This page was built for publication: Stack and Queue Numbers of Graphs Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6429972)
