REMARKS ON THE THICKNESS OF A GRAPH

Authors
AHO I MAKINEN E SYSTA T
Citation
I. Aho et al., REMARKS ON THE THICKNESS OF A GRAPH, Information sciences, 108(1-4), 1998, pp. 1-4
Citations number
9
Categorie Soggetti
Computer Science Information Systems","Computer Science Information Systems
Journal title
Information sciences → ACNP
ISSN journal
00200255
Volume
108
Issue
1-4
Year of publication
1998
Pages
1 - 4
Database
ISI
SICI code
0020-0255(1998)108:1-4<1:ROTTOA>2.0.ZU;2-3
Abstract
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.