On the queue-number of the hypercube

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10103312" target="_blank" >RIV/00216208:11320/11:10103312 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.endm.2011.09.067" target="_blank" >http://dx.doi.org/10.1016/j.endm.2011.09.067</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.endm.2011.09.067" target="_blank" >10.1016/j.endm.2011.09.067</a>

Result language
angličtina
Original language name
On the queue-number of the hypercube
Original language description
A queue layout of a graph consists of a linear ordering of its vertices, and a partition of its edges into sets, called queues, such that in each set no two edges are nested with respect to the ordering. A queue-number of G is the minimal number of queues in a queue layout of G. We improve previously known upper and lower bounds on the queue-number of the hypercube.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GP201%2F08%2FP298" target="_blank" >GP201/08/P298: Subgraphs of hypercubes and their applications</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)