Abstract
A k-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.
| Original language | English |
|---|---|
| Pages (from-to) | 255-268 |
| Number of pages | 14 |
| Journal | Discrete Mathematics and Theoretical Computer Science |
| Volume | 7 |
| Issue number | 1 |
| Publication status | Published - 2005 |
| Externally published | Yes |