A construction of thickness-minimal graphs

Abstract The thickness of a graph G is the minimum number of planar subgraphs whose union is G. A t-minimal graph is a graph of thickness t which contains no proper subgraph of thickness t. For each t⩾2 we present an explicit construction of an infinite number of t-minimal graphs with connectivity 2, edge connectivity t, and minimum valency t.