Crossing-Free Subgraphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- On edges crossing few other edges in simple topological complete graphs
- Degenerate crossing numbers
- Extremal problems on triangle areas in two and three dimensions
- On polygons enclosing point sets. II
- A lower bound for the optimal crossing-free Hamiltonian cycle problem
- A primer of the Euclidean Steiner problem
- How to find Steiner minimal trees in Euclidean \(d\)-space
- Penny-packing and two-dimensional codes
- Graphs drawn with few crossings per edge
- On counting triangulations in d dimensions
- Counting triangle crossings and halving planes
- Onion polygonizations
- On the number of simplicial complexes in \(\mathbb{R}^ d\)
- Crossing-number critical graphs have bounded path-width
- On distinct sums and distinct distances.
- A successful concept for measuring non-planarity of graphs: The crossing number.
- 2-point site Voronoi diagrams
- A crossing lemma for Jordan curves
- Anchored expansion, speed and the Poisson-Voronoi tessellation in symmetric spaces
- On the number of touching pairs in a set of planar curves
- The number of crossings in multigraphs with no empty lens
- Crossing numbers and stress of random graphs
- On degree properties of crossing-critical families of graphs
- Which crossing number is it anyway?
- A better upper bound on the number of triangulations of a planar point set
- Crossing number, pair-crossing number, and expansion
- On numbers of pseudo-triangulations
- On the degenerate crossing number
- Crossing number for graphs with bounded pathwidth
- On the complexity of the \(k\)-level in arrangements of pseudoplanes
- Testing gap \(k\)-planarity is NP-complete
- Crossing lemma for the odd-crossing number
- Computing colourful simplicial depth and Median in \(\mathbb{R}_2\)
- Non-homotopic loops with a bounded number of pairwise intersections
- On the number of edges of separated multigraphs
- The crossing number of twisted graphs
- On topological graphs with at most four crossings per edge
- A crossing lemma for multigraphs
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Many touchings force many crossings
- Approximating the rectilinear crossing number
- A new lower bound on the maximum number of plane graphs using production matrices
- Geometric biplane graphs. I: Maximal graphs
- Lower bounds on the maximum number of non-crossing acyclic graphs
- Counting triangulations and other crossing-free structures via onion layers
- On the number of plane geometric graphs
- Trapezoidal diagrams, upward triangulations, and prime Catalan numbers
- On 2-site Voronoi diagrams under geometric distance functions
- Gray code enumeration of plane straight-line graphs
- On the decay of crossing numbers
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- On bipartite distinct distances in the plane
- Crossings between non-homotopic edges
- Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)
- Distinct distances on non-ruled surfaces and between circles
- Configurations of non-crossing rays and related problems
- Counting carambolas
- The Mathematics of Ferran Hurtado: A Brief Survey
- The Bundled Crossing Number
- Approximating the rectilinear crossing number
- Counting plane graphs with exponential speed-up
- Graphs that admit right angle crossing drawings
- On the number of anchored rectangle packings for a planar point set
- Graph minors and the crossing number of graphs
- On the number of anchored rectangle packings for a planar point set
- Convex polygons in geometric triangulations
- On planar intersection graphs with forbidden subgraphs
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
- Crossings in grid drawings
- Progress on Dirac's conjecture
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- Graphs that admit right angle crossing drawings
- Planar crossing numbers of graphs of bounded genus
- An incidence theorem in higher dimensions
- The crossing number of the cone of a graph
- Many touchings force many crossings
- Robust Tverberg and Colourful Carathéodory Results via Random Choice
- Quasi-planar Graphs
- \(k\)-planar graphs
- Crossings Between Non-homotopic Edges
- 2-Layer k-Planar Graphs
- Sumsets of semiconvex sets
- The number of crossings in multigraphs with no empty lens
- Bounded degree conjecture holds precisely for c-crossing-critical graphs with c 12
- scientific article; zbMATH DE number 7559262 (Why is no real title available?)
- Beyond-planarity: Turán-type results for non-planar bipartite graphs
- Two-Planar Graphs Are Quasiplanar
- Structure and generation of crossing-critical graphs
- A crossing lemma for multigraphs
- A survey of graphs with known or bounded crossing numbers
- Efficient generation of different topological representations of graphs beyond-planarity
- Simultaneous arithmetic progressions on algebraic curves
- Simultaneous embeddings with few bends and crossings
- A Census of Plane Graphs with Polyline Edges
- Number of crossing-free geometric graphs vs. Triangulations
- Convex Polygons in Geometric Triangulations
- A Bipartite Strengthening of the Crossing Lemma
- On degrees in random triangulations of point sets
- scientific article; zbMATH DE number 7651192 (Why is no real title available?)
- String graphs and incomparability graphs
This page was built for publication: Crossing-Free Subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967549)
