Queue layouts of graph products and powers

MaRDI QIDQ5387660zbMATH OpenFDO

Authors David R. Wood

Publication date 27 May 2008

Full work available at URL https://eudml.org/doc/129519, https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/53/showToc.html

zbMATH Keywords

graph productpower of a graphqueue layout

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On the queue-number of the hypercube
• Stack and queue layouts of some graph products
• Laying Out Graphs Using Queues
• Queue layouts of planar 3-trees
• Queue layouts of hypercubes

Cited in

(19)

• Stack-number is not bounded by queue-number
• An improved upper bound on the queue number of the hypercube
• Layered separators in minor-closed graph classes with applications
• Computing square roots of trivially perfect and threshold graphs
• On the queue-number of the hypercube
• Topological graph layouts into a triangular prism
• Stack and queue layouts of some graph products
• Layouts of Expander Graphs
• Laying Out Graphs Using Queues
• Graph layouts via layered separators
• (3,2)-Track Layout of Bipartite Graph Subdivisions
• Queue layouts of two-dimensional posets
• Shallow Minors, Graph Products, and Beyond-Planar Graphs
• Stack and queue numbers of graphs revisited
• Structural properties of graph products
• Stack and queue numbers of graphs revisited
• A new upper bound on the queuenumber of hypercubes
• Erratum to: ``A new upper bound on the queuenumber of hypercubes
• Upper bounds on the queue number of \(k\)-ary \(n\)-cubes

This page was built for publication: Queue layouts of graph products and powers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387660)