Detailed Information on Publication Record
2023
Stack and Queue Numbers of Graphs Revisited
HLINĚNÝ, Petr and Adam STRAKABasic information
Original name
Stack and Queue Numbers of Graphs Revisited
Authors
HLINĚNÝ, Petr (203 Czech Republic, guarantor, belonging to the institution) and Adam STRAKA (703 Slovakia, belonging to the institution)
Edition
Brno, Czech Republic, European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23, p. 601-606, 6 pp. 2023
Publisher
MUNI Press
Other information
Language
English
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Czech Republic
Confidentiality degree
není předmětem státního či obchodního tajemství
Publication form
electronic version available online
RIV identification code
RIV/00216224:14330/23:00131121
Organization unit
Faculty of Informatics
ISSN
Keywords in English
linear layout; stack number; queue number
Tags
Tags
International impact, Reviewed
Změněno: 22/3/2024 07:59, prof. RNDr. Petr Hliněný, Ph.D.
Abstract
V originále
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 ``half-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.
Links
| MUNI/A/1081/2022, interní kód MU |
|