Queue layouts on folded hypercubes

DOI10.1016/J.DAM.2025.04.056MaRDI QIDQ6965783zbMATH OpenFDO

Authors Xin Geng, Yueyang Hao, Weihua Yang

Publication date 30 June 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.04.056

zbMATH Keywords

folded hypercubehypercubepagenumberqueue layout

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A new upper bound on the queuenumber of hypercubes
• A note on ``An improved upper bound on the queue number of the hypercube
• An improved upper bound on the queue number of the hypercube
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Embedding planar 5-graphs in three pages
• Graph product structure for non-minor-closed classes
• scientific article; zbMATH DE number 2159644 (Why is no real title available?)
• Laying Out Graphs Using Queues
• Layout of Graphs with Bounded Tree-Width
• On the queue number of planar graphs
• On the queue-number of graphs with bounded tree-width
• Planar graphs have bounded queue-number
• Queue layouts of hypercubes
• Queue layouts of planar 3-trees
• Stack and queue number of 2-trees
• Track layouts, layered path decompositions, and leveled planarity
• Upper bounds on the queue number of \(k\)-ary \(n\)-cubes

Cited in

(1)

• An improved upper bound on the queue number of the folded hypercube

This page was built for publication: Queue layouts on folded hypercubes

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