Skip to Main content Skip to Navigation
Journal articles

Queue Layouts of Graph Products and Powers

Abstract : 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
Document type :
Journal articles
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/hal-00959041
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 5:09:18 PM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM
Long-term archiving on: : Friday, June 13, 2014 - 12:18:15 PM

File

dm070115.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00959041, version 1

Collections

Citation

David R. Wood. Queue Layouts of Graph Products and Powers. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2005, 7, pp.255-268. ⟨hal-00959041⟩

Share

Metrics

Record views

160

Files downloads

933