Min-k-planar drawings of graphs
From MaRDI portal
Publication:6560142
Cites work
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- Adding one edge to planar graphs makes crossing number and 1-planarity hard
- Algorithms for graphs embeddable with few crossings per edge
- An annotated bibliography on 1-planarity
- Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 -- December 1, 2016
- Efficient generation of different topological representations of graphs beyond-planarity
- Efficient generation of different topological representations of graphs beyond-planarity
- Ein Sechsfarbenproblem auf der Kugel
- Fan-planar graphs: combinatorial properties and complexity results
- Fan-planarity: properties and complexity
- Gap-Planar Graphs
- Gap-planar graphs
- Graphs drawn with few crossings per edge
- Improving the crossing lemma by finding more crossings in sparse graphs
- Nonplanar Graph Drawings with k Vertices per Face
- Notes on large angle crossing graphs
- On Optimal 2- and 3-Planar Graphs
- On the maximum number of edges in quasi-planar graphs
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- On topological graphs with at most four crossings per edge
- Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
- Planar decompositions and the crossing number of graphs with an excluded minor
- Quasi-planar graphs have a linear number of edges
- Recognizing and embedding simple optimal 2-planar graphs
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- The density of fan-planar graphs
- The number of edges in \(k\)-quasi-planar graphs
- Über 1-optimale Graphen
This page was built for publication: Min-\(k\)-planar drawings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560142)
