A new upper bound on the queuenumber of hypercubes
From MaRDI portal
Publication:965977
DOI10.1016/j.disc.2009.09.007zbMath1231.05190OpenAlexW2057100034MaRDI QIDQ965977
Kung-Jui Pai, Yue-Li Wang, Jou-Ming Chang
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.09.007
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)
Related Items (3)
Unnamed Item ⋮ Erratum to ``A new upper bound on the queuenumber of hypercubes [Discrete Math. 310, No. 4, 935-939 (2010; Zbl 1231.05190)] ⋮ Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
Cites Work
- Queue layouts of iterated line directed graphs
- A note on ``An improved upper bound on the queue number of the hypercube
- An improved upper bound on the queue number of the hypercube
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Posets
- Layout of Graphs with Bounded Tree-Width
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new upper bound on the queuenumber of hypercubes
