Determining the thickness of graphs is NP-hard

[1]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[2]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[3]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[4]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .