Stack and queue numbers of graphs revisited

DOI10.1016/J.EJC.2024.104094MaRDI QIDQ6945770zbMATH OpenFDO

Authors Petr Hliněný, Adam Straka

Publication date 8 August 2025

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2024.104094

Mathematics Subject Classification ID

Graph theory (05Cxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A combinatorial problem in geometry.
• A genetic algorithm for finding the pagenumber of interconnection networks
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Laying Out Graphs Using Queues
• On 3-coloring circle graphs
• On a problem of formal logic.
• Planar graphs have bounded queue-number
• Queue layouts of graph products and powers
• Sorting Using Networks of Queues and Stacks
• Stack-number is not bounded by queue-number
• Stacks, queues and tracks: layouts of graph subdivisions
• Subsets of \(n\)-books in \(E^ 3\)
• The book thickness of a graph
• The Game of Hex and the Brouwer Fixed-Point Theorem

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