Biplanar graphs: A survey
From MaRDI portal
Recommendations
Cited in
(20)- The biplanar tree graph
- Geometric biplane graphs. I: Maximal graphs
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
- On the bigenus of the complete graphs
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
- Planarization and fragmentability of some classes of graphs
- On the Biplanarity of Blowups
- Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem
- Index 3 biembeddings of the complete graphs
- The complexity of the empire colouring problem
- Finding a biplanar imbedding of \(C_n\times C_n\times C_l\times P_m\).
- Note on \(k\)-planar crossing numbers
- A note on Halton's conjecture
- On the biplanarity of blowups
- The thickness of some complete bipartite and tripartite graphs
- Remarks on the thickness and outerthickness of a graph
- scientific article; zbMATH DE number 3845604 (Why is no real title available?)
- On the complexity of the maximum biplanar subgraph problem
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Geometric thickness in a grid
This page was built for publication: Biplanar graphs: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388965)