Queue layouts of graph products and powers

Research output: Contribution to journalArticleResearchpeer-review

18 Citations (Scopus)


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 languageEnglish
Pages (from-to)255-268
Number of pages14
JournalDiscrete Mathematics and Theoretical Computer Science
Issue number1
Publication statusPublished - 2005
Externally publishedYes

Cite this