$$\textit{\textbf{k}}$$-Planar Graphs
From MaRDI portal
Publication:5001659
DOI10.1007/978-981-15-6533-5_7zbMath1487.05071OpenAlexW3117856752MaRDI QIDQ5001659
Publication date: 22 July 2021
Published in: Beyond Planar Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-15-6533-5_7
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Outer 1-planar graphs
- A note on 1-planar graphs
- Improving the crossing lemma by finding more crossings in sparse graphs
- On an extremal problem in the class of bipartite 1-planar graphs
- Optimal 1-planar graphs which triangulate other surfaces
- Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Graphs drawn with few crossings per edge
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
- Recognizing optimal 1-planar graphs in linear time
- Gap-planar graphs
- On-line maintenance of triconnected components with SPQR-trees
- On edge colorings of \(1\)-planar graphs
- Testing gap \(k\)-planarity is NP-complete
- On topological graphs with at most four crossings per edge
- Ein Sechsfarbenproblem auf der Kugel
- An annotated bibliography on 1-planarity
- Algorithms for graphs embeddable with few crossings per edge
- Recognizing hole-free 4-map graphs in cubic time
- Generation of simple quadrangulations of the sphere
- Testing Full Outer-2-planarity in Linear Time
- Recursive generation of simple planar 5-regular graphs and pentangulations
- Fáry’s Theorem for 1-Planar Graphs
- On the Density of Non-simple 3-Planar Graphs
- Re-embeddings of Maximum 1-Planar Graphs
- Über 1-optimale Graphen
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Rectilinear drawings of graphs
- Crossing-Free Subgraphs
- Efficient Planarity Testing
- On Optimal 2- and 3-Planar Graphs
- Parameterized Complexity of 1-Planarity
- Beyond Outerplanarity
- A new proof of the 6 color theorem
- Two-Planar Graphs Are Quasiplanar
- Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
- TRÉMAUX TREES AND PLANARITY
This page was built for publication: $$\textit{\textbf{k}}$$-Planar Graphs
