A successful concept for measuring non-planarity of graphs: The crossing number.
From MaRDI portal
(Redirected from Publication:1422437)
Recommendations
- A successful concept for measuring non-planarity of graphs: the crossing number
- Crossing Numbers of Beyond-Planar Graphs Revisited
- Crossing numbers of beyond-planar graphs
- Crossing numbers of beyond-planar graphs
- On the crossing number of almost planar graphs
- On the Crossing Number of Almost Planar Graphs
- On graph crossing number and edge planarization
- On the size of planarly connected crossing graphs
- On the Size of Planarly Connected Crossing Graphs
- The crossing number of 2-planar graphs and its application
Cites work
- scientific article; zbMATH DE number 3924797 (Why is no real title available?)
- scientific article; zbMATH DE number 3957138 (Why is no real title available?)
- scientific article; zbMATH DE number 1188564 (Why is no real title available?)
- scientific article; zbMATH DE number 3685512 (Why is no real title available?)
- scientific article; zbMATH DE number 3521895 (Why is no real title available?)
- scientific article; zbMATH DE number 475621 (Why is no real title available?)
- scientific article; zbMATH DE number 1054768 (Why is no real title available?)
- scientific article; zbMATH DE number 1452728 (Why is no real title available?)
- scientific article; zbMATH DE number 1507304 (Why is no real title available?)
- scientific article; zbMATH DE number 1359487 (Why is no real title available?)
- scientific article; zbMATH DE number 3803471 (Why is no real title available?)
- scientific article; zbMATH DE number 3446923 (Why is no real title available?)
- scientific article; zbMATH DE number 3235858 (Why is no real title available?)
- scientific article; zbMATH DE number 3258070 (Why is no real title available?)
- scientific article; zbMATH DE number 3306563 (Why is no real title available?)
- scientific article; zbMATH DE number 3394160 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- A combinatorial problem on polynomials and rational functions
- An upper bound for the rectilinear crossing number of the complete graph
- Bounds for rectilinear crossing numbers
- Convexity and sumsets
- Crossing Number Problems
- Crossing Number is NP-Complete
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Crossing-Free Subgraphs
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- Determining the thickness of graphs is NP-hard
- Drawings of graphs on surfaces with few crossings
- Graphs drawn with few crossings per edge
- Improved approximations of crossings in graph drawings
- Improved bounds for planar k-sets and related problems
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
- New bounds on crossing numbers
- New results on rectilinear crossing numbers and plane embeddings
- On a problem of P. Turan concerning graphs
- On the Number of Incidences Between Points and Curves
- On the crossing numbers of certain generalized Petersen graphs
- On the crossing numbers of products of cycles and graphs of order four
- On the number of sums and products
- Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
- The Set of Differences of a Given Set
- The crossing number of K5,n
- The crossing number of \(C_3\times C_n\)
- The crossing number of a graph on a compact 2-manifold
- The crossing number ofC5 �Cn
- The crossing numbers of Cartesian products of paths with 5-vertex graphs
- The crossing numbers of products of paths and stars with 4‐vertex graphs
- The crossing numbers of some generalized Petersen graphs.
- Toward a theory of crossing numbers
Cited in
(33)- Rotation and crossing numbers for join products
- The crossing number of \(K_{1,m,n}\)
- Crossing numbers of graphs with rotation systems
- Crossing number and weighted crossing number of near-planar graphs
- Characterisations and examples of graph classes with bounded expansion
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
- The Crossing Number of Graphs: Theory and Computation
- A crossing lemma for multigraphs
- Removing even crossings
- scientific article; zbMATH DE number 1894431 (Why is no real title available?)
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
- ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
- The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds
- Crossing lemma for the odd-crossing number
- On Canonical Concurrent Flows, Crossing Number and Graph Expansion
- Removing even crossings on surfaces
- Odd crossing number and crossing number are not the same
- Treewidth, Circle Graphs, and Circular Drawings
- The \(\mathbb{Z}_2\)-genus of Kuratowski minors
- Adjacent Crossings Do Matter
- Note on \(k\)-planar crossing numbers
- On quasi-planar graphs: clique-width and logical description
- Crossings between non-homotopic edges
- Survey of the crossing number of graphs
- An algorithm of graph planarity testing and cross minimization
- The crossing number of \(K_{5,n+1} \setminus e\)
- Two recursive inequalities for crossing numbers of graphs
- Removing Even Crossings on Surfaces
- Crossing and Weighted Crossing Number of Near-Planar Graphs
- Simple realizability of complete abstract topological graphs simplified
- A crossing lemma for multigraphs
- Crossings Between Non-homotopic Edges
- On the crossing numbers of loop networks and generalized Petersen graphs
This page was built for publication: A successful concept for measuring non-planarity of graphs: The crossing number.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422437)
