Biplanar graphs: A survey (Q1388965)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1164073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Biplanar graphs: A survey |
scientific article; zbMATH DE number 1164073 |
Statements
Biplanar graphs: A survey (English)
0 references
11 June 1998
0 references
A biplanar graph is the union of two planar graphs; thus its thickness is at most two. In this survey article, the author presents various properties of biplanar graphs, two special families of biplanar graphs (doubly linear graphs and rectangle visibility graphs), and extensions to other surfaces, both orientable and nonorientable (biembeddings). \textit{A. Mansfield} [Math. Proc. Camb. Philos. Soc. 93, 9-23 (1983; Zbl 0503.68048)] showed that determining whether a given graph is biplanar is an NP-complete problem. However, as shown in the present paper, every graph is homeomorphic to a biplanar graph.
0 references
biplanar graph
0 references
0.8164834976196289
0 references
0.7810506820678711
0 references
0.7743256092071533
0 references
