ON THE THICKNESS OF A GRAPH

The thickness of a graph is the minimum number of planar subgraphs into which the graph can be decomposed. This note discusses some recent attempts to determine upper bounds for the thickness of a graph as a function of the number of edges or as a function of its maximum degree.

[1]  Michael Jünger,et al.  The thickness of a minor-excluded class of graphs , 1998, Discret. Math..

[2]  John H. Halton,et al.  On the thickness of graphs of given degree , 1991, Inf. Sci..

[3]  Edward R. Scheinerman,et al.  On the thickness and arboricity of a graph , 1991, J. Comb. Theory, Ser. B.

[4]  Frank Harary,et al.  Graph Theory , 2016 .

[5]  Robert J. Cimikowski,et al.  On Heuristics for Determining the Thickness of a Graph , 1995, Inf. Sci..

[6]  L. Beineke,et al.  On the thickness of the complete graph , 1964 .

[7]  J. Moon,et al.  On the thickness of the complete bipartite graph , 1964, Mathematical Proceedings of the Cambridge Philosophical Society.

[8]  V B Alekseev,et al.  THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH , 1976 .