Biplanar graphs: A survey (Q1388965): Difference between revisions
From MaRDI portal
Removed claims |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / author | |||
Property / author: Lowell W. Beineke / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Arthur T. White / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 04:10, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Biplanar graphs: A survey |
scientific article |
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