Quantitative Restrictions on Crossing Patterns
From MaRDI portal
Publication:5001654
DOI10.1007/978-981-15-6533-5_2zbMath1476.05142OpenAlexW3090172241MaRDI QIDQ5001654
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_2
\(k\)-quasiplanar graphsbeyond-planar graphs\(k\)-planar graph\(k\)-gap-planar graphs\(k\)-locally planar graphs
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
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- A note on 1-planar graphs
- A lower bound on the diameter of the flip graph
- Improving the crossing lemma by finding more crossings in sparse graphs
- On the maximum number of edges in quasi-planar graphs
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs
- On edges crossing few other edges in simple topological complete graphs
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Edges and switches, tunnels and bridges
- Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Graphs drawn with few crossings per edge
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Recognizing optimal 1-planar graphs in linear time
- The number of crossings in multigraphs with no empty lens
- Geometric graphs with no self-intersecting path of length three
- Applications of the crossing number
- A new planarity test
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- On topological graphs with at most four crossings per edge
- A crossing lemma for multigraphs
- On grids in topological graphs
- Defective colouring of graphs excluding a subgraph or minor
- Saturated simple and \(k\)-simple topological graphs
- The rectilinear local crossing number of \(K_{n}\)
- Ein Sechsfarbenproblem auf der Kugel
- Unified Hanani-Tutte theorem
- An annotated bibliography on 1-planarity
- The book thickness of 1-planar graphs is constant
- \(\mathsf{NIC}\)-planar graphs
- Coloring curves that cross a fixed curve
- Algorithms for graphs embeddable with few crossings per edge
- Topological graphs with no large grids
- Mondshein Sequences (a.k.a. (2,1)-Orders)
- Construction of Locally Plane Graphs with Many Edges
- Fáry’s Theorem for 1-Planar Graphs
- Simple Realizability of Complete Abstract Topological Graphs Simplified
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Crossing Stars in Topological Graphs
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Rectilinear drawings of graphs
- Efficient Planarity Testing
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Improvements on the density of maximal 1‐planar graphs
- On Optimal 2- and 3-Planar Graphs
- Crossing Numbers of Graphs
- On the size of planarly connected crossing graphs
- Parameterized Complexity of 1-Planarity
- Saturated simple and 2-simple topological graphs with few edges
- Gap-Planar Graphs
- A new proof of the 6 color theorem
- On the Density of Maximal 1-Planar Graphs
- 1-Planarity of Graphs with a Rotation System
- Structure of Graphs with Locally Restricted Crossings
- Tightening Nonsimple Paths and Cycles on Surfaces
- Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
- Applications of a New Separator Theorem for String Graphs
- Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
- Enumeration of simple complete topological graphs
- Inserting an edge into a geometric embedding
- Colouring arcwise connected sets in the plane. I
This page was built for publication: Quantitative Restrictions on Crossing Patterns
