Optimal 1-planar graphs which triangulate other surfaces
From MaRDI portal
Publication:1045136
DOI10.1016/J.DISC.2009.07.016zbMATH Open1188.05056OpenAlexW2045737295MaRDI QIDQ1045136FDOQ1045136
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
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
- scientific article; zbMATH DE number 7779756
- Relationship among triangulations, quadrangulations and optimal 1-planar graphs
- Optimal polygonal representation of planar graphs
- Optimal polygonal representation of planar graphs
- Triangulating planar graphs while minimizing the maximum degree
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Ein Sechsfarbenproblem auf der Kugel
- The structure of 1-planar graphs
- Generation of simple quadrangulations of the sphere
- Title not available (Why is that?)
- Zur Struktur 1‐planarer Graphen
- Über 1-optimale Graphen
- \(N\)-flips in even triangulations on surfaces
- N-flips in even triangulations on the sphere
- \(N\)-flips in even triangulations on the projective plane
- Panel structures of triangulations on the torus
- Constructing the graphs that triangulate both the torus and the Klein bottle
- Planar triangulations which quadrangulate other surfaces
- Title not available (Why is that?)
- Graphs that triangulate a given surface and quadrangulate another surface
Cited In (24)
- Generating polyhedral quadrangulations of the projective plane
- Beyond Planar Graphs: Introduction
- A linear-time algorithm for testing outer-1-planarity
- On drawings and decompositions of 1-planar graphs
- Title not available (Why is that?)
- On morphing 1-planar drawings
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- $$\textit{\textbf{k}}$$-Planar Graphs
- Edge Partitions and Visibility Representations of 1-planar Graphs
- Algorithms for 1-Planar Graphs
- Title not available (Why is that?)
- No optimal 1-planar graph triangulates the non-orientable closed surface of genus 4
- Relationship among triangulations, quadrangulations and optimal 1-planar graphs
- Fan-planarity: properties and complexity
- Right angle crossing graphs and 1-planarity
- \(\mathsf{NIC}\)-planar graphs
- An annotated bibliography on 1-planarity
- Optimal 1-planar multigraphs
- Right angle crossing graphs and 1-planarity
- Note on improper coloring of $1$-planar graphs
- List edge and list total coloring of 1-planar graphs
- On partitioning the edges of 1-plane graphs
- Light subgraphs in the family of 1-planar graphs with high minimum degree
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)
