Optimal 1-planar graphs which triangulate other surfaces

DOI10.1016/J.DISC.2009.07.016MaRDI QIDQ1045136zbMATH OpenOpenAlexFDO

Authors Yusuke Suzuki

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2009.07.016

zbMATH Keywords

triangulationclosed surfaceoptimal 1-planar graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Optimal 1-planar graphs which quadrangulate other surfaces
• Optimal 1-embedded graphs on the projective plane which triangulate other surfaces
• No optimal 1-planar graph triangulates any nonorientable closed surface
• Optimal 1-planar multigraphs
• On Optimal 2- and 3-Planar Graphs
• On optimal beyond-planar graphs
• Relationship among triangulations, quadrangulations and optimal 1-planar graphs
• Triangulating planar graphs while minimizing the maximum degree

Cites work

• scientific article; zbMATH DE number 3900784 (Why is no real title available?)
• scientific article; zbMATH DE number 1565795 (Why is no real title available?)
• Constructing the graphs that triangulate both the torus and the Klein bottle
• Ein Sechsfarbenproblem auf der Kugel
• Generation of simple quadrangulations of the sphere
• Graphs that triangulate a given surface and quadrangulate another surface
• N-flips in even triangulations on the sphere
• Panel structures of triangulations on the torus
• Planar triangulations which quadrangulate other surfaces
• The structure of 1-planar graphs
• Zur Struktur 1‐planarer Graphen
• \(N\)-flips in even triangulations on surfaces
• \(N\)-flips in even triangulations on the projective plane
• Über 1-optimale Graphen

Cited in

(30)

• Light subgraphs in the family of 1-planar graphs with high minimum degree
• A linear-time algorithm for testing outer-1-planarity
• Generating polyhedral quadrangulations of the projective plane
• On drawings and decompositions of 1-planar graphs
• On morphing 1-planar drawings
• scientific article; zbMATH DE number 4185634 (Why is no real title available?)
• A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces
• Note on improper coloring of 1-planar graphs.
• Re-embedding a 1-plane graph for a straight-line drawing in linear time
• The matching extendability of optimal 1-planar graphs
• A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
• Edge Partitions and Visibility Representations of 1-planar Graphs
• Beyond planar graphs: introduction
• Algorithms for 1-Planar Graphs
• Relationship among triangulations, quadrangulations and optimal 1-planar graphs
• No optimal 1-planar graph triangulates the non-orientable closed surface of genus 4
• Right angle crossing graphs and 1-planarity
• Fan-planarity: properties and complexity
• \(\mathsf{NIC}\)-planar graphs
• An annotated bibliography on 1-planarity
• On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
• Optimal 1-planar multigraphs
• Right angle crossing graphs and 1-planarity
• List edge and list total coloring of 1-planar graphs
• \(k\)-planar graphs
• On partitioning the edges of 1-plane graphs
• Optimal 1-planar graphs which quadrangulate other surfaces
• No optimal 1-planar graph triangulates any nonorientable closed surface
• Optimal 1-embedded graphs on the projective plane which triangulate other surfaces
• On optimal beyond-planar graphs

This page was built for publication: Optimal 1-planar graphs which triangulate other surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045136)