Queue Layouts of Graph Products and Powers

Abstract

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

Keywords

• hamming graph
• graph
• queue layout
• cartesian product
• d-dimensional grid graph
• d-dimensional toroidal grid graph
• [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]