A \emphk-queue layout of a graph G consists of a linear order σ of V(G), and a partition of E(G) into k sets, each of which contains no two edges that are nested in σ . This paper studies queue layouts of graph products and powers
Kung-Jui Pai;Jou-Ming Chang;Yue-Li Wang;Ro-Yu Wu, 2014, Queue Layouts of Toroidal Grids, IEICE transactions on fundamentals of electronics, communications and computer sciences/IEICE transactions on fundamentals of electronics, communications and computer science, E97.A, 6, pp. 1180-1186, 10.1587/transfun.e97.a.1180.
Petr Gregor;Riste Škrekovski;Vida Vukašinović, 2011, On the queue-number of the hypercube, Electronic notes in discrete mathematics, 38, pp. 413-418, 10.1016/j.endm.2011.09.067.
Kung-Jui Pai;Jou-Ming Chang;Yue-Li Wang, 2010, A new upper bound on the queuenumber of hypercubes, Discrete mathematics, 310, 4, pp. 935-939, 10.1016/j.disc.2009.09.007.
Kung-Jui Pai;Jou-Ming Chang;Yue-Li Wang, 2009, Upper bounds on the queuenumber of k-ary n-cubes, Information processing letters, 110, 2, pp. 50-56, 10.1016/j.ipl.2009.10.006.