A class of thickness-minimal graphs
Arthur M. Hobbs, Jerrold W. Grossman · Journal of Research of the National Bureau of Standards Section B Mathematical Sciences · 1968
Th e thic kne ss of a graph C is th e minimum numbe r of planar subgraph s wh ose union is C. A t-minimal graph is a graph of thickn ess t whi c h contains no proper subgr a ph of thic kness t.In this pape r, we s how tha t the co mplete bipartite gra ph on two sets e ac h containin g 4t-5 ve rtices is t-minim al for all t "" 2. We also show th at if the co mplete gra ph on 16 ve rtices has thi c kne ss 4, it is 4•minimal.