The Thickness of Amalgamations and Cartesian Product of Graphs

Abstract The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been known for only few graphs. We obtain the thickness of vertex-amalgamation and bar-amalgamation of graphs, the lower and upper bounds for the thickness of edge-amalgamation and 2-vertex-amalgamation of graphs, respectively. We also study the thickness of Cartesian product of graphs, and by using operations on graphs, we derive the thickness of the Cartesian product Kn □ Pm for most values of m and n.

[1]  Kouhei Asano.  On the genus and thickness of graphs , 1987, J. Comb. Theory, Ser. B.

[2]  Edward R. Scheinerman,et al.  On the thickness and arboricity of a graph , 1991, J. Comb. Theory, Ser. B.

[3]  L. Beineke,et al.  On the thickness of the complete graph , 1964 .

[4]  Petra Mutzel,et al.  The Thickness of Graphs: A Survey , 1998, Graphs Comb..

[5]  J. Moon,et al.  On the thickness of the complete bipartite graph , 1964, Mathematical Proceedings of the Cambridge Philosophical Society.

[6]  Alok Aggarwal,et al.  Multilayer grid embeddings for VLSI , 2005, Algorithmica.

[7]  F. Harary,et al.  Additivity of the genus of a graph , 1962 .

[8]  M. Behzad,et al.  On Topological Invariants of the Product of Graphs , 1969, Canadian Mathematical Bulletin.

[9]  Robert J. Cimikowski,et al.  On Heuristics for Determining the Thickness of a Graph , 1995, Inf. Sci..

[10]  Anthony Mansfield,et al.  Determining the thickness of graphs is NP-hard , 1983, Mathematical Proceedings of the Cambridge Philosophical Society.

[11]  Jianer Chen,et al.  A Note on Approximating Graph Genus , 1997, Inf. Process. Lett..

[12]  M. Kleinert.  Die dicke des n-dimensionalen Würfel-graphen , 1967 .

[13]  E. Mäkinen,et al.  An annotated bibliography on the thickness, outerthickness, and arboricity of a graph , 2012 .

[14]  Henry H. Glover,et al.  The genus of the 2-amalgamations of graphs , 1981, J. Graph Theory.

[15]  W. T. Tutte,et al.  The thickness of a graph , 1963 .

[16]  V B Alekseev,et al.  THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH , 1976 .

[17]  L. Beineke,et al.  The Thickness of the Complete Graph , 1965, Canadian Journal of Mathematics.

[18]  John H. Halton,et al.  On the thickness of graphs of given degree , 1991, Inf. Sci..

[19]  Timo Poranen,et al.  A simulated annealing algorithm for determining the thickness of a graph , 2005, Inf. Sci..