Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Queue Layouts of Gra ...
Article

Queue Layouts of Graph Products and Powers

David R. Wood ORCID (1)
(1) Departament de Matemàtica Aplicada II
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2005
Last modified on
March 31, 2025
Volume 7
vol. 7
DOI
10.46298/dmtcs.352
License
https://about.hal.science/hal-authorisation-v1
Indicators
1217
Views
1566
Downloads

Queue Layouts of Graph Products and Powers

David R. Wood ORCID (1)
(1) Departament de Matemàtica Aplicada II
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
Keywords
English
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
French
  • graph
  • queue layout
  • cartesian product
  • d-dimensional grid graph
  • d-dimensional toroidal grid graph
  • Hamming graph
Cited by

Source: OpenCitations

  • Erratum to “A new upper bound on the queuenumber of hypercubes” [Discrete Math. 310 (2010) 935–939]

    Discrete Mathematics

    Authors : Kung-Jui Pai ORCID, Jou-Ming Chang ORCID, Yue-Li Wang

    Journal reference : Volume 310, 2010, pp. 2059

    DOI : 10.1016/j.disc.2010.02.002
  • On the queue-number of the hypercube

    Electronic Notes in Discrete Mathematics

    Authors : Petr Gregor ORCID, Riste Škrekovski ORCID, Vida Vukašinović ORCID

    Journal reference : Volume 38, 2011, pp. 413-418

    DOI : 10.1016/j.endm.2011.09.067
  • Queue Layouts of Toroidal Grids

    IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

    Authors : Kung-Jui PAI ORCID, Jou-Ming CHANG ORCID, Yue-Li WANG, Ro-Yu WU

    Journal reference : Volume E97.A, 2014, pp. 1180-1186

    DOI : 10.1587/transfun.e97.a.1180
  • An improved upper bound on the queuenumber of the hypercube

    Information Processing Letters

    Authors : Toru Hasunuma ORCID, Misa Hirota

    Journal reference : Volume 104, 2007, pp. 41-44

    DOI : 10.1016/j.ipl.2007.05.006
  • Computing square roots of trivially perfect and threshold graphs

    Discrete Applied Mathematics

    Authors : Martin Milanič ORCID, Oliver Schaudt ORCID

    Journal reference : Volume 161, 2013, pp. 1538-1545

    DOI : 10.1016/j.dam.2012.12.027
  • Three-Dimensional Graph Products with Unbounded Stack-Number

    Discrete & Computational Geometry

    Authors : David Eppstein, Robert Hickingbotham ORCID, Laura Merker ORCID, Sergey Norin ORCID, Michał T. Seweryn ORCID, David R. Wood ORCID

    Journal reference : Volume 71, 2023, pp. 1210-1237

    DOI : 10.1007/s00454-022-00478-6
  • Shallow Minors, Graph Products, and Beyond-Planar Graphs

    SIAM Journal on Discrete Mathematics

    Authors : Robert Hickingbotham ORCID, David R. Wood ORCID

    Journal reference : Volume 38, 2024, pp. 1057-1089

    DOI : 10.1137/22m1540296
  • Stack and Queue Numbers of Graphs Revisited

    Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications

    Authors : Petr Hlineny ORCID, Adam Straka

    Journal reference : Volume , 2023, pp. 601-606

    DOI : 10.5817/cz.muni.eurocomb23-083
  • Planar Graphs have Bounded Queue-Number

    Jagiellonian University Repository (Jagiellonian University)

    Authors : Vida Dujmovic ORCID, Gwenaël Joret ORCID, Piotr Micek ORCID, Pat Morin ORCID, Torsten Ueckerdt ORCID, David Wood ORCID

    Journal reference : Volume 2019, 2019, pp. 862-875

    DOI : 10.1109/focs.2019.00056
  • Upper bounds on the queuenumber of k-ary n-cubes

    Information Processing Letters

    Authors : Kung-Jui Pai ORCID, Jou-Ming Chang ORCID, Yue-Li Wang

    Journal reference : Volume 110, 2009, pp. 50-56

    DOI : 10.1016/j.ipl.2009.10.006
  • Stack and queue numbers of graphs revisited

    European Journal of Combinatorics

    Authors : Petr Hliněný ORCID, Adam Straka

    Journal reference : Volume 129, 2024, pp. 104094

    DOI : 10.1016/j.ejc.2024.104094
  • Graph layouts via layered separators

    Journal of Combinatorial Theory Series B

    Authors : Vida Dujmović ORCID

    Journal reference : Volume 110, 2014, pp. 79-89

    DOI : 10.1016/j.jctb.2014.07.005
  • A new upper bound on the queuenumber of hypercubes

    Discrete Mathematics

    Authors : Kung-Jui Pai ORCID, Jou-Ming Chang ORCID, Yue-Li Wang

    Journal reference : Volume 310, 2009, pp. 935-939

    DOI : 10.1016/j.disc.2009.09.007
Preview
Loading PDF preview...