笛卡尔积图K_n□C_m的厚度

The Thickness of the Cartesian Product K_n□C_m

构造了完全图Kn的1个特殊平面分解,进而确定了部分笛卡尔积图K_n□C_m的厚度.图的厚度是图分解为平面生成子图的最小数.图的厚度是图的拓扑不变量,也是度量1个图的可平面性的重要指标.

The thickness of a graph G is the minimum number of planar spanning subgraphs into which G can be decomposed. The thickness of a graph is one of the topological invariants of the graph and it is an important index to measure the planarity of a graph and widely used in large scale integrated circuit and network design. This paper constructs a special planar decomposition of complete graph Knsuch that determines the partial thickness of Cartesian product K_n□C_m.