Toward a theory of crossing numbers
From MaRDI portal
Publication:5578799
Cited in
(74)- Almost all string graphs are intersection graphs of plane convex sets
- Some provably hard crossing number problems
- On the number of edges of separated multigraphs
- A characterization of planar graphs by Trémaux orders
- The $\mathbb{Z}_2$-genus of Kuratowski minors
- Level planarity: transitivity vs. even crossings
- On pseudo-disk hypergraphs
- Genetic algorithms for drawing bipartite graphs
- Bad drawings of small complete graphs
- Crossing minimization in perturbed drawings
- Crossing minimization in perturbed drawings
- Abstract order type extension and new results on the rectilinear crossing number
- Crossing numbers of graphs with rotation systems
- Hardness of embedding simplicial complexes in R^d
- A new approach to the linearity of testing planarity of graphs
- The Crossing Number of Graphs: Theory and Computation
- Hanani-Tutte and monotone drawings
- On grids in topological graphs
- Removing even crossings
- A direct proof of the strong Hanani-Tutte theorem on the projective plane
- Towards the Hanani-Tutte theorem for clustered graphs
- Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
- On Boolean characterizations of planarity and planar embeddings of graphs
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Conflict-free coloring of string graphs
- Pfaffian graphs, \(T\)-joins and crossing numbers
- Coloring intersection hypergraphs of pseudo-disks
- Which crossing number is it anyway?
- Crossing number, pair-crossing number, and expansion
- Geometric graphs with no self-intersecting path of length three
- On the crossing number of complete graphs
- A crossing lemma for Jordan curves
- Thrackles, superthrackles and the Hanani-Tutte theorem
- The complexity of planarity testing
- On the embeddability of skeleta of spheres
- On the strong Hanani-Tutte theorem
- Clustered planarity testing revisited
- A note on the parity of the number of crossings of a graph
- The crossing number of locally twisted cubes \(L T Q_n\)
- Removing even crossings on surfaces
- Odd crossing number and crossing number are not the same
- Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes
- Boolean approach to planar embeddings of a graph
- The \(\mathbb{Z}_2\)-genus of Kuratowski minors
- Monotone Crossing Number
- On the Size of Planarly Connected Crossing Graphs
- Adjacent Crossings Do Matter
- Embedding dimensions of simplicial complexes on few vertices
- Embeddings of \(k\)-complexes into \(2k\)-manifolds
- Parameterized analysis and crossing minimization problems
- An evolutionary formulation of the crossing number problem
- On string graph limits and the structure of a typical string graph
- Geometria combinatoria e geometrie finite
- A sharp threshold phenomenon in string graphs
- Crossing-number critical graphs have bounded path-width
- Unified Hanani-Tutte theorem
- Almost all string graphs are intersection graphs of plane convex sets
- Coloring intersection hypergraphs of pseudo-disks
- Removing Even Crossings on Surfaces
- Hanani-Tutte for radial planarity. II
- Planar diagrams for local invariants of graphs in surfaces
- Simple realizability of complete abstract topological graphs simplified
- On codimension one embedding of simplicial complexes
- Note on the pair-crossing number and the odd-crossing number
- An upper bound for the crossing number of augmented cubes
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Many touchings force many crossings
- Many touchings force many crossings
- Hanani-Tutte for approximating maps of graphs
- Obstacle numbers of planar graphs
- Finding Minors in Graphs with a Given Path Structure
- scientific article; zbMATH DE number 7559239 (Why is no real title available?)
- Level-planarity: transitivity vs. even crossings
- Boolean planarity characterization of graphs
This page was built for publication: Toward a theory of crossing numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5578799)
