Queue layouts of graph products and powers
A k-queue layout of a graph G consists of a linear order sigma of V ( G), and a partition of E( G) into k sets, each of which contains no two edges that are nested in sigma. This paper studies queue layouts of graph products and powers.
queue layout graph cartesian product d-dimensional grid graph d-dimensional toroidal grid graph hamming graph