On the skewness of Cartesian products with trees

Abstract The skewness of a graph G is the minimum number of edges in G whose removal results in a planar graph. It is a parameter that measures how non-planar a graph is, and it also has important applications to VLSI design, but there are few results for skewness of graphs. In this paper, we first prove that the skewness is additive for the Zip product under certain conditions. We then present results on the lower bounds for the skewness of Cartesian products of graphs with trees and paths, respectively. Some exact values of the skewness for Cartesian products of complete graphs with trees, as well as of stars and wheels with paths are obtained by applying these lower bounds.

[1]  Annegret Liebers,et al.  Journal of Graph Algorithms and Applications Planarizing Graphs — a Survey and Annotated Bibliography , 2022 .

[2]  Drago Bokal,et al.  On the crossing numbers of Cartesian products with paths , 2007, J. Comb. Theory, Ser. B.

[3]  F. Harary,et al.  A survey of the theory of hypercube graphs , 1988 .

[4]  Mihalis Yannakakis,et al.  Edge-Deletion Problems , 1981, SIAM J. Comput..

[5]  Markus Chimani,et al.  Non-planar core reduction of graphs , 2009, Discret. Math..

[6]  R. Guy.  The Slimming Number and Genus of Graphs , 1972, Canadian Mathematical Bulletin.

[7]  C. G. Ling.  Skewness and crossing numbers of graphs , 2009 .

[8]  Frank Harary,et al.  Graph Theory , 2016 .

[9]  Celina M. H. de Figueiredo,et al.  The splitting number and skewness of Cn x Cm , 2002, Ars Comb..

[10]  Emilio Di Giacomo,et al.  Polyline Drawings with Topological Constraints , 2018, ISAAC.

[11]  Walter Didimo,et al.  A Survey on Graph Drawing Beyond Planarity , 2018, ACM Comput. Surv..

[12]  Chan L. Lee,et al.  Skewness of generalized Petersen graphs and related graphs , 2012 .

[13]  Peter Eades,et al.  Skewness of Graphs with Small Cutsets , 2003, Graphs Comb..

[14]  Drago Bokal.  On the crossing numbers of Cartesian products with trees , 2007, J. Graph Theory.

[15]  Frank Thomson Leighton,et al.  New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[16]  Gek L. Chia,et al.  On the skewness of the join of graphs , 2013, Discret. Appl. Math..

[17]  N Mendonca,et al.  A layout system for information system diagrams , 1994 .