Biplanar graphs: A survey
From MaRDI portal
Publication:1388965
DOI10.1016/S0898-1221(97)00214-9zbMath0903.05015MaRDI QIDQ1388965
Publication date: 11 June 1998
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (13)
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem ⋮ On the bigenus of the complete graphs ⋮ Index 3 biembeddings of the complete graphs ⋮ Planarization and fragmentability of some classes of graphs ⋮ Note on \(k\)-planar crossing numbers ⋮ Geometric thickness in a grid ⋮ The complexity of the empire colouring problem ⋮ A note on Halton's conjecture ⋮ Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method ⋮ Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill ⋮ Geometric biplane graphs. I: Maximal graphs ⋮ Remarks on the thickness and outerthickness of a graph
This page was built for publication: Biplanar graphs: A survey
