scientific article; zbMATH DE number 7779756
From MaRDI portal
Publication:6179340
DOI10.57717/cgt.v2i1.10arXiv2201.00783MaRDI QIDQ6179340
Publication date: 16 December 2023
Full work available at URL: https://arxiv.org/abs/2201.00783
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)
Cites Work
- Recognizing and drawing IC-planar graphs
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- Drawing graphs with right angle crossings
- On the maximum number of edges in quasi-planar graphs
- Optimal 1-planar graphs which triangulate other surfaces
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- On fan-crossing and fan-crossing free graphs
- Recognizing optimal 1-planar graphs in linear time
- 1-fan-bundle-planar drawings of graphs
- Characterizing and recognizing 4-map graphs
- Gap-planar graphs
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Right angle crossing graphs and 1-planarity
- On representations of some thickness-two graphs
- The density of fan-planar graphs
- Recognizing and embedding simple optimal 2-planar graphs
- On topological graphs with at most four crossings per edge
- On fan-crossing graphs
- Efficient generation of different topological representations of graphs beyond-planarity
- On grids in topological graphs
- Characterizing 5-map graphs by 2-fan-crossing graphs
- Ein Sechsfarbenproblem auf der Kugel
- \(K_7\)-minors in optimal 1-planar graphs
- An annotated bibliography on 1-planarity
- \(\mathsf{NIC}\)-planar graphs
- Topological graphs with no large grids
- Generation of simple quadrangulations of the sphere
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Graph Theory
- Recursive generation of simple planar 5-regular graphs and pentangulations
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
- On the Number of Edges of Fan-Crossing Free Graphs
- Re-embeddings of Maximum 1-Planar Graphs
- Über 1-optimale Graphen
- Chromatic number, independence ratio, and crossing number
- Zur Struktur 1‐planarer Graphen
- Recognizing IC-Planar and NIC-Planar Graphs
- On Optimal 2- and 3-Planar Graphs
- A First Order Logic Definition of Beyond-Planar Graphs
- Representations of Planar Graphs
- On the Density of Maximal 1-Planar Graphs
- Beyond Planar Graphs
- Computing Circle Packing Representations of Planar Graphs
This page was built for publication:
