Crossing number, pair-crossing number, and expansion
From MaRDI portal
Publication:1880792
DOI10.1016/j.jctb.2003.09.002zbMath1051.05038OpenAlexW2000052110MaRDI QIDQ1880792
Publication date: 1 October 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2003.09.002
Related Items (11)
Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ String graphs and incomparability graphs ⋮ On grids in topological graphs ⋮ Near-Optimal Separators in String Graphs ⋮ Odd crossing number and crossing number are not the same ⋮ A bipartite strengthening of the crossing Lemma ⋮ A Separator Theorem for String Graphs and its Applications ⋮ A Separator Theorem for String Graphs and Its Applications ⋮ A Bipartite Strengthening of the Crossing Lemma ⋮ The Crossing Number of Graphs: Theory and Computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A framework for solving VLSI graph layout problems
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Which crossing number is it anyway?
- Applications of the crossing number
- Bounds for Convex Crossing Numbers
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- New lower bound techniques for VLSI
- Crossing-Free Subgraphs
- On VLSI layouts of the star graph and related networks
- Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
- Crossing numbers of random graphs
- The book crossing number of a graph
- Combinatorial Geometry and Graph Theory
- Toward a theory of crossing numbers
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication: Crossing number, pair-crossing number, and expansion
