Maximizing the Degree of (Geometric) Thickness-t Regular Graphs

  • Christian A. DuncanEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9411)


In this paper, we show that there exist \((6t-1)\)-regular graphs with thickness t, by constructing such an example graph. Since all graphs of thickness t must have at least one node with degree less than 6t, this construction is optimal. We also show, by construction, that there exist 5t-regular graphs with geometric thickness at most t. Our construction for the latter builds off of a relationship between geometric thickness and the Cartesian product of two graphs.


  1. 1.
    Battle, J., Harary, F., Kodama, Y.: Every planar graph with nine points has a nonplanar complement. Bull. Amer. Math. Soc. 68(6), 569–571 (1962). MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. J. Graph Algorithms Appl. 4(3), 5–17 (2000). MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Durocher, S., Gethner, E., Mondal, D.: Thickness and colorability of geometric graphs. In: Brandstädt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 237–248. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  4. 4.
    Harary, F.: Research problem. Bull. Amer. Math. Soc. 67, 542 (1961)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Kainen, P.: Thickness and coarseness of graphs. Abh. aus dem Mathematischen Semin. der Univ. Hamburg 39(1), 88–95 (1973). MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Mutzel, P., Odenthal, T., Scharbrodt, M.: The thickness of graphs: a survey. Graphs Comb. 14(1), 59–73 (1998). MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Tutte, W.T.: The non-biplanar character of the complete 9-graph. Can. Math. Bull. 6(3), 319–330 (1963)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Tutte, W.T.: The thickness of a graph. Indagationes Math. 25, 567–577 (1963)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceQuinnipiac UniversityHamdenUSA

Personalised recommendations