Thickness and outerthickness for embedded graphs

We consider the thickness $\theta (G))$ and outerthickness $\theta _o(G)$ of a graph G in terms of its orientable and nonorientable genus. Dean and Hutchinson provided upper bounds for thickness of graphs in terms of their orientable genus. More recently, Concalves proved that the outerthickness of any planar graph is at most 2. In this paper, we apply the method of deleting spanning disks of embeddings to approximate the thickness and outerthickness of graphs. We first obtain better upper bounds for thickness. We then use a similar approach to provide upper bounds for outerthickness of graphs in terms of their orientable and nonorientable genera. Finally we show that the outerthickness of the torus (the maximum outerthickness of all toroidal graphs) is 3. We also show that all graphs embeddable in the double torus have thickness at most 3 and outerthickness at most 5.

[1]  Daniel Gonçalves,et al.  Edge partition of planar sraphs into two outerplanar graphs , 2005, STOC '05.

[2]  C. Nash-Williams.  Decomposition of Finite Graphs Into Forests , 1964 .

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

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

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

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

[7]  Michael Jünger,et al.  The thickness of a minor-excluded class of graphs , 1998, Discret. Math..

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

[9]  E. Critchley,et al.  Surface , 2014 .

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

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

[12]  G. Chartrand,et al.  Graphs with Forbidden Subgraphs , 1971 .

[13]  Bogdan Oporowski,et al.  Surfaces, Tree-Width, Clique-Minors, and Partitions , 2000, J. Comb. Theory, Ser. B.

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

[15]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[16]  J. Hutchinson,et al.  Relations among Embedding Parameters for Graphs , 2009 .

[17]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[18]  R. Guy,et al.  The Outerthickness & Outercoarseness of Graphs I. The Complete Graph & The n-Cube , 1990 .

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

[20]  Kiran S. Kedlaya.  Outerplanar Partitions of Planar Graphs , 1996, J. Comb. Theory, Ser. B.