The thickness of a graph is the minimum number of planar subgraphs int
o which the graph can be decomposed. This note discusses some recent a
ttempts to determine upper bounds for the thickness of a graph as a fu
nction of the number of edges or as a function of its maximum degree.
(C) 1998 Elsevier Science Inc. All rights reserved.