Abstract
We use special diagrams to find some specific graphs that are embedded in some surfaces, surface graphs. Specifically, we represent each face of a surface graph G as a plane polygon with boundary vertices and edges are labelled by vertices and edges of G. Using this representation, it is possible to represent G by drawing a labelled collection of polygons. We call such a drawing a polygon representation. We use this representation to generate certain surface graphs that are tight.
Similar content being viewed by others
References
Archdeacon, D.: Topological graph theory: a survey. Surveys in graph theory (San Francisco, CA, 1995). Congr. Numer. 115, 5–54 (1996)
Barnette, D.: Generating the triangulations of the projective plane. J. Combin. Theory Ser. B 33, 222–230 (1982)
Cruickshank, J., Kitson, D., Power, S.C., Shakir, Q.: Topological inductive constructions for tight surface graphs. Graphs and Combinatorics 38, 169 (2022)
Fekete, Z., Szego, L.: A note on \([k, l]\)-sparse graphs. In: Bondy, A., et al. (eds.) Graph Theory in Paris Trends in Mathematics, pp. 169–177. Birkhäuser, Basel (2007)
Graver, J.E.: Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures. The Dolciani Mathematical Expositions, vol. 25. Mathematical Association of America, Washington (2001)
Graver, J., Servatius, B., Servatius, H.: Combinatorial Rigidity. Graduate Studies in Mathematics, vol. 2. American Mathematical Society, Providence, RI (1993)
Laman, G.: On graphs and rigidity of plane skeletal structures. J. Eng. Math. 4, 331–340 (1970)
Lavrenchenko, S.A.: Irreducible triangulations of the torus. Russian Ukrain. Geom. Sb. 30, 52–62 (1987)
Lavrenchenko, S.A.: Irreducible triangulations of the torus. J. Soviet Math. 51, 2537–2543 (1990)
Lawrencenko, S., Negami, S.: Irreducible triangulations of the Klein bottle. J. Combin. Theory Ser. B. 70, 265–291 (1997)
Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD (2001)
Sulanke, T.: Note on the irreducible triangulations of the Klein bottle. J. Combin. Theory Ser. B. 96, 964–972 (2006)
Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. Lond. Math. Soc. 36, 221–230 (1961)
Acknowledgements
The author is grateful to James Cruickshank for suggesting the main idea of this article. Furthermore, the author would like to express his gratitude to anonymous reviewers for their valuable comments.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interests
The author has no conflicts of interest to declare that are relevant to the content of this article.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Shakir, Q.R. Polygon Representations of Surface Graphs. Vietnam J. Math. (2023). https://doi.org/10.1007/s10013-023-00620-8
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10013-023-00620-8