Queue Layouts of Graph Products and Powers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2005

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
Fichier principal
Vignette du fichier
dm070115.pdf (164.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00959041 , version 1 (13-03-2014)

Identifiers

Cite

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

Collections

TDS-MACS
80 View
874 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More