Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{2294852, author = {Hliněný, Petr and Straka, Adam}, address = {Brno, Czech Republic}, booktitle = {European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23}, doi = {http://dx.doi.org/10.5817/CZ.MUNI.EUROCOMB23-083}, keywords = {linear layout; stack number; queue number}, howpublished = {elektronická verze "online"}, language = {eng}, location = {Brno, Czech Republic}, pages = {601-606}, publisher = {MUNI Press}, title = {Stack and Queue Numbers of Graphs Revisited}, year = {2023} }
TY - JOUR ID - 2294852 AU - Hliněný, Petr - Straka, Adam PY - 2023 TI - Stack and Queue Numbers of Graphs Revisited PB - MUNI Press CY - Brno, Czech Republic KW - linear layout KW - stack number KW - queue number N2 - 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. ER -
HLINĚNÝ, Petr a Adam STRAKA. Stack and Queue Numbers of Graphs Revisited. Online. In \textit{European Conference on Combinatorics, Graph Theory and Applications EUROCOMB’23}. Brno, Czech Republic: MUNI Press, 2023, s.~601-606. ISSN~2788-3116. Dostupné z: https://dx.doi.org/10.5817/CZ.MUNI.EUROCOMB23-083.
|