Thickness of graphs with degree constrained vertices

Simple formulas are obtained for the thickness of complete and complete bipartite graphs when the degrees of the vertices of the planar subgraphs are constrained by the requirements of routing in rectilinear metric, using essentially Euler's formula and certain constructive procedures. These results are also suitable for adaptation in graphs with other degree constraints on vertices, and are potentially useful in the routing of multinets on multilayers.