Queue layouts of hypercubes
DOI10.1137/100813865zbMATH Open1245.05094OpenAlexW2055059625MaRDI QIDQ2902890FDOQ2902890
Authors: Petr Gregor, Riste Škrekovski, Vida Vukašinović
Publication date: 22 August 2012
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/616affd8d77bde8006f5b877f714606f5c12db72
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65) Applications of graph theory to circuits and networks (94C15)
Cited In (15)
- A new upper bound on the queuenumber of hypercubes
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
- Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution
- Title not available (Why is that?)
- LINEAR LAYOUT OF GENERALIZED HYPERCUBES
- Erratum to: ``A new upper bound on the queuenumber of hypercubes
- An improved upper bound on the queue number of the hypercube
- Queue layouts of iterated line directed graphs
- Graph Drawing
- Title not available (Why is that?)
- Graph Drawing
- Linear layouts of generalized hypercubes
- Queue layouts of graph products and powers
- Queue layouts of two-dimensional posets
- On the queue-number of graphs with bounded tree-width
This page was built for publication: Queue layouts of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902890)