Min-\(k\)-planar drawings of graphs
From MaRDI portal
Publication:6616240
DOI10.7155/jgaa.v28i2.2925MaRDI QIDQ6616240
Michael Kaufmann, Pat Morin, Aaron Büngener, Giuseppe Liotta, Walter Didimo, Seok-Hee Hong, Carla Binucci, Giuseppe Di Battista, Vida Dujmović, Alessandra Tappini
Publication date: 8 October 2024
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Improving the crossing lemma by finding more crossings in sparse graphs
- On the maximum number of edges in quasi-planar graphs
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- Gap-planar graphs
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- The density of fan-planar graphs
- Recognizing and embedding simple optimal 2-planar graphs
- On topological graphs with at most four crossings per edge
- Fan-planarity: properties and complexity
- Planar decompositions and the crossing number of graphs with an excluded minor
- Ein Sechsfarbenproblem auf der Kugel
- An annotated bibliography on 1-planarity
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- Algorithms for graphs embeddable with few crossings per edge
- Fan-Planar Graphs: Combinatorial Properties and Complexity Results
- On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
- Über 1-optimale Graphen
- Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
- The crossing number ofK1,3,n andK2,3,n
- On Optimal 2- and 3-Planar Graphs
- Gap-Planar Graphs
- Beyond Planar Graphs
- Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
- The Number of Edges in $k$-Quasi-planar Graphs
- Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
- Notes on large angle crossing graphs
- Nonplanar Graph Drawings with k Vertices per Face
This page was built for publication: Min-\(k\)-planar drawings of graphs
