Abstract
In this paper, we examine relationship of graphs on surfaces: triangulations, quadrangulations and optimal \(1\)-planar graphs. For a given quadrangulation \(G\) of a closed surface \(F^2, G\) can be extended to a triangulation by adding a diagonal edge in every face of \(G\). We show that every quadrangulation of \(F^2\) with at least six vertices can be extended to a \(4\)-connected triangulation. Moreover, we show that every \(5\)-connected triangulation of \(F^2\) has a \(3\)-connected spanning quadrangulation subgraph. As corollaries of these results, we show that every optimal \(1\)-planar graph has a \(4\)-connected triangulation subgraph, and that every plane \(5\)-connected triangulation can be extended to an optimal \(1\)-planar graph by adding some edges.
Similar content being viewed by others
References
Bauer, D., Broersma, H., Schmeichel, E.: Toughness in graphs: a survey. Graphs Comb. 22, 1–35 (2006)
Fabrici, I., Madaras, T.: The structure of \(1\)-planar graphs. Discrete Math. 307, 854–865 (2007)
Hudák, D., Madaras, T., Suzuki, Y.: On properties of maximal \(1\)-planar graphs. Discuss. Math. Graph Theory 32, 737–747 (2012)
Nakamoto, A., Noguchi, K., Ozeki, K.: Extension to even triangulations. SIAM J. Discrete Math. (in revision)
Petersen, J.: Die Theorie der regulären graphs. Acta Math. 15, 193–220 (1891)
Ringel, G.: Ein Sechsfarbenproblem auf der kugel. Abh. Math. Sem. Univ. Hamburg 29, 107–117 (1965)
Suzuki, Y.: Optimal \(1\)-planar graphs which triangulate other surfaces. Discrete Math. 310, 6–11 (2010)
Suzuki, Y.: Re-embeddings of maximum \(1\)-planar graphs. SIAM J. Discrete Math. 24, 1527–1540 (2010)
Thomas, R., Yu, X.: \(4\)-connected projective-planar graphs are Hamiltonian. J. Combin. Theory Ser. B 62, 114–132 (1994)
Tutte, W.T.: A theorem on planar graphs. Trans. Am. Math. Soc 82, 99–116 (1956)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Noguchi, K., Suzuki, Y. Relationship Among Triangulations, Quadrangulations and Optimal \(1\)-Planar Graphs. Graphs and Combinatorics 31, 1965–1972 (2015). https://doi.org/10.1007/s00373-015-1568-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-015-1568-8