Crossing-Free Subgraphs
From MaRDI portal
Publication:3967549
Cited in
(only showing first 100 items - show all)- On the number of edges of separated multigraphs
- A survey of graphs with known or bounded crossing numbers
- Crossing number for graphs with bounded pathwidth
- On the decay of crossing numbers
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- Geometric biplane graphs. I: Maximal graphs
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- On 2-site Voronoi diagrams under geometric distance functions
- Crossing numbers and stress of random graphs
- The number of crossings in multigraphs with no empty lens
- Counting plane graphs with exponential speed-up
- On the intersections of non-homotopic loops
- The number of crossings in multigraphs with no empty lens
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- scientific article; zbMATH DE number 7651192 (Why is no real title available?)
- Crossings in grid drawings
- On degree properties of crossing-critical families of graphs
- Gray code enumeration of plane straight-line graphs
- On the number of touching pairs in a set of planar curves
- A bipartite strengthening of the crossing Lemma
- Characterisations and examples of graph classes with bounded expansion
- Graphs that admit right angle crossing drawings
- The Bundled Crossing Number
- A crossing lemma for multigraphs
- Configurations of non-crossing rays and related problems
- On degrees in random triangulations of point sets
- String graphs and incomparability graphs
- Approximating the rectilinear crossing number
- On the number of anchored rectangle packings for a planar point set
- Quasi-planar Graphs
- Book embeddings and crossing numbers
- Two-Planar Graphs Are Quasiplanar
- Graph product structure for non-minor-closed classes
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
- On counting triangulations in d dimensions
- 2-point site Voronoi diagrams
- Counting carambolas
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Convex Polygons in Geometric Triangulations
- Computing colourful simplicial depth and Median in \(\mathbb{R}_2\)
- On the complexity of the \(k\)-level in arrangements of pseudoplanes
- On bipartite distinct distances in the plane
- Graphs drawn with few crossings per edge
- A Census of Plane Graphs with Polyline Edges
- Robust Tverberg and Colourful Carathéodory Results via Random Choice
- Approximating the rectilinear crossing number
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Testing gap \(k\)-planarity is NP-complete
- Planar crossing numbers of graphs of bounded genus
- Efficient generation of different topological representations of graphs beyond-planarity
- Which crossing number is it anyway?
- Crossing number, pair-crossing number, and expansion
- General lower bounds for the minor crossing number of graphs
- A crossing lemma for Jordan curves
- Degenerate crossing numbers
- 2-Layer k-Planar Graphs
- A Szemerédi-Trotter type theorem in R^4
- A new lower bound on the maximum number of plane graphs using production matrices
- Distinct distances on non-ruled surfaces and between circles
- A Bipartite Strengthening of the Crossing Lemma
- An incidence theorem in higher dimensions
- Graphs that admit right angle crossing drawings
- Number of crossing-free geometric graphs vs. Triangulations
- A lower bound for the optimal crossing-free Hamiltonian cycle problem
- Non-crossing Hamiltonian paths and cycles in output-polynomial time
- Non-homotopic loops with a bounded number of pairwise intersections
- On topological graphs with at most four crossings per edge
- Crossing patterns of segments
- On numbers of pseudo-triangulations
- Lower bounds on the maximum number of non-crossing acyclic graphs
- Extremal problems on triangle areas in two and three dimensions
- Crossing lemma for the odd-crossing number
- Structure and generation of crossing-critical graphs
- A better upper bound on the number of triangulations of a planar point set
- Simultaneous arithmetic progressions on algebraic curves
- The Dirac-Goodman-Pollack conjecture
- Counting triangulations and other crossing-free structures via onion layers
- Counting triangle crossings and halving planes
- Anchored expansion, speed and the Poisson-Voronoi tessellation in symmetric spaces
- Extremal problems for geometric hypergraphs
- The crossing number of the cone of a graph
- On crossing numbers of geometric proximity graphs
- How to find Steiner minimal trees in Euclidean \(d\)-space
- A primer of the Euclidean Steiner problem
- On the number of anchored rectangle packings for a planar point set
- Convex polygons in geometric triangulations
- Crossings between non-homotopic edges
- On distinct sums and distinct distances.
- On the number of plane geometric graphs
- On polygons enclosing point sets. II
- On the number of simplicial complexes in \(\mathbb{R}^ d\)
- Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\)
- Sequences of spanning trees and a fixed tree theorem
- On edges crossing few other edges in simple topological complete graphs
- Crossing-number critical graphs have bounded path-width
- scientific article; zbMATH DE number 7559214 (Why is no real title available?)
- Onion polygonizations
- Simultaneous embeddings with few bends and crossings
- On the degenerate crossing number
- \(k\)-planar 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)
