Skewness of Graphs with Small Cutsets

Abstract. The skewness of a graph is the minimum number of edges that have to be removed to leave a planar subgraph. This is complementary, and computationally equivalent, to the Maximum Planar Subgraph problem. In this paper we look at the problem of computing the skewness of a graph with a small cutset. We show how to express the skewness of a graph with a cutset of size at most 4 in terms of the skewnesses of several derived graphs obtained by cutting along that cutset and `stitching up' afterwards. We conclude with a discussion on possible applications to planarisation.

[1]  Anusch Taraz,et al.  On the Maximum Planar Subgraph Problem , 1996 .

[2]  Michael Jünger,et al.  Maximum planar subgraphs and nice embeddings: Practical layout tools , 1996, Algorithmica.

[3]  Robert E. Tarjan,et al.  An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem , 1992, SIAM J. Comput..

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

[5]  Michael Jünger,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, Graph Drawing.

[6]  M.N.S. Swamy,et al.  O(n2) algorithms for graph planarization , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[10]  Cristina G. Fernandes,et al.  A better approximation algorithm for finding planar subgraphs , 1996, SODA '96.

[11]  Candido Ferreira Xavier de Mendonça Neto,et al.  Splitting Number is NP-complete , 1998 .

[12]  Paul C. Kainen,et al.  A generalization of the 5-color theorem , 1974 .

[13]  Martin Dyer,et al.  Analysis of heuristics for finding a maximum weight planar subgraph , 1985 .

[14]  Olivier Goldschmidt,et al.  An efficient graph planarization two-phase heuristic , 1994, Networks.

[15]  Graham Farr,et al.  An Algorithm for Finding Large Induced Planar Subgraphs , 2001, Graph Drawing.