David R. Wood - Queue Layouts of Graph Products and Powers

dmtcs:352 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, Vol. 7 - https://doi.org/10.46298/dmtcs.352
Queue Layouts of Graph Products and Powers

Authors: David R. Wood ORCID-iD1

  • 1 Departament de Matemàtica Aplicada II

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

https://doi.org/10.46298/dmtcs.352
Source: HAL:hal-00959041v1
Volume: Vol. 7
Published on: January 1, 2005
Imported on: March 26, 2015
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]

Linked publications - datasets - softwares

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
  • 1306.1595
  • 10.1016/j.jctb.2017.05.006
  • 10.48550/arxiv.1306.1595
Layered separators in minor-closed graph classes with applications☆

7 Documents citing this article

Share and export

Consultation statistics

This page has been seen 285 times.
This article's PDF has been downloaded 431 times.