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

DOI10.1016/J.DAM.2025.11.024MaRDI QIDQ6866653zbMATH OpenFDO

Authors Kung-Jui Pai

Publication date 28 January 2026

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

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

zbMATH Keywords

folded hypercubehypercubequeue layoutqueue number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A new upper bound on the queuenumber of hypercubes
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• 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
• Queue layouts on folded hypercubes
• Stack and queue number of 2-trees
• Upper bounds on the queue number of \(k\)-ary \(n\)-cubes

This page was built for publication: An improved upper bound on the queue number of the folded hypercube

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