Toward a theory of crossing numbers

DOI10.1016/S0021-9800(70)80007-2zbMATH Open0187.20803MaRDI QIDQ5578799FDOQ5578799

Authors: William T. Tutte 

Publication date: 1970

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

topology

Cited In (74)

• The $\mathbb{Z}_2$-genus of Kuratowski minors
• A direct proof of the strong Hanani-Tutte theorem on the projective plane
• Thrackles, superthrackles and the Hanani-Tutte theorem
• On the embeddability of skeleta of spheres
• On the strong Hanani-Tutte theorem
• Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes
• Embeddings of \(k\)-complexes into \(2k\)-manifolds
• Unified Hanani-Tutte theorem
• Hanani-Tutte for radial planarity. II
• Many touchings force many crossings
• Almost all string graphs are intersection graphs of plane convex sets
• Some provably hard crossing number problems
• A characterization of planar graphs by Trémaux orders
• Level planarity: transitivity vs. even crossings
• Genetic algorithms for drawing bipartite graphs
• Crossing minimization in perturbed drawings
• Crossing minimization in perturbed drawings
• Bad drawings of small complete graphs
• On pseudo-disk hypergraphs
• Abstract order type extension and new results on the rectilinear crossing number
• Crossing numbers of graphs with rotation systems
• The Crossing Number of Graphs: Theory and Computation
• Hardness of embedding simplicial complexes in \(\mathbb R^d\)
• A new approach to the linearity of testing planarity of graphs
• Hanani-Tutte and monotone drawings
• On grids in topological graphs
• Removing even crossings
• Towards the Hanani-Tutte theorem for clustered graphs
• On Boolean characterizations of planarity and planar embeddings of graphs
• Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces
• 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
• The complexity of planarity testing
• A note on the parity of the number of crossings of a graph
• Clustered planarity testing revisited
• The crossing number of locally twisted cubes \(L T Q_n\)
• Odd crossing number and crossing number are not the same
• Boolean approach to planar embeddings of a graph
• Removing even crossings on surfaces
• Monotone Crossing Number
• The \(\mathbb{Z}_2\)-genus of Kuratowski minors
• Adjacent Crossings Do Matter
• Embedding dimensions of simplicial complexes on few vertices
• On the Size of Planarly Connected Crossing Graphs
• Parameterized analysis and crossing minimization problems
• Geometria combinatoria e geometrie finite
• On string graph limits and the structure of a typical string graph
• An evolutionary formulation of the crossing number problem
• A sharp threshold phenomenon in string graphs
• Crossing-number critical graphs have bounded path-width
• Almost all string graphs are intersection graphs of plane convex sets
• Removing Even Crossings on Surfaces
• Coloring intersection hypergraphs of pseudo-disks
• Planar diagrams for local invariants of graphs in surfaces
• On codimension one embedding of simplicial complexes
• Simple realizability of complete abstract topological graphs simplified
• 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
• Hanani-Tutte for approximating maps of graphs
• Obstacle numbers of planar graphs
• Finding Minors in Graphs with a Given Path Structure
• Title not available (Why is that?)
• Boolean planarity characterization of graphs
• Level-planarity: transitivity vs. even crossings
• On the number of edges of separated multigraphs

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)