Queue Layouts of Graph Products and Powers
David R. Wood · Discrete Mathematics & Theoretical Computer Science · 2005
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