The Local Queue Number of Graphs with Bounded Treewidth
From MaRDI portal
Publication:5014102
Cites work
- scientific article; zbMATH DE number 15359 (Why is no real title available?)
- scientific article; zbMATH DE number 1954397 (Why is no real title available?)
- Bipartite dimensions and bipartite degrees of graphs
- Caterpillar arboricity of planar graphs
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Covering and packing in graphs IV: Linear arboricity
- Decomposition of Finite Graphs Into Forests
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
- Edge intersection graphs of linear 3-uniform hypergraphs
- Laying Out Graphs Using Queues
- Layout of Graphs with Bounded Tree-Width
- Local and union page numbers
- Multilayer grid embeddings for VLSI
- On the page number of RNA secondary structures with pseudoknots
- On the queue-number of graphs with bounded tree-width
- Planar graphs have bounded queue-number
- Processor-efficient sparse matrix-vector multiplication
- Queue layouts of planar 3-trees
- Stack and queue number of 2-trees
- The book thickness of a graph
- The thickness of graphs: A survey
- Three ways to cover a graph
Cited in
(5)
This page was built for publication: The Local Queue Number of Graphs with Bounded Treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014102)