Informace o publikaci
Stack and queue numbers of graphs revisited
| Autoři | |
|---|---|
| Rok publikování | 2025 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | EUROPEAN JOURNAL OF COMBINATORICS |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | arXiv preprint |
| Doi | http://dx.doi.org/10.1016/j.ejc.2024.104094 |
| Klíčová slova | stack number; queue number; Cartesian product |
| Popis | A long-standing question of the mutual relation between the stack and queue numbers of a graph, explicitly emphasized by Dujmović and Wood in 2005, was partially answered by Dujmović, 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. |