![]() |
Discrete Mathematics & Theoretical Computer Science |
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
Source : ScholeXplorer
IsRelatedTo ARXIV 1306.1595 Source : ScholeXplorer IsRelatedTo DOI 10.1016/j.jctb.2017.05.006 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1306.1595
|