General lower bounds for the minor crossing number of graphs
From MaRDI portal
Publication:5962348
DOI10.1007/s00454-010-9245-4zbMath1194.05024OpenAlexW2079621156MaRDI QIDQ5962348
Imrich Vrt'o, Drago Bokal, Éva Czabarka, László A. Székely
Publication date: 22 September 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-010-9245-4
graph minorcrossing numberbisection methodcrossing lemmaembedding methodHypercubeminor crossing numberstring graphs
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expansion and isoperimetric constants for product graphs
- The minor crossing number of graphs with an excluded minor
- String graphs. II: Recognizing string graphs is NP-hard
- String graphs. I: The number of critical nonstring graphs is infinite
- String graphs requiring exponential representations
- Edge separators for graphs of bounded genus with applications
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
- The crossing number of a graph on a compact 2-manifold
- Matchings and paths in the cube
- Optimal meshes of curves in the Klein bottle
- New bounds on crossing numbers
- Recognizing string graphs is decidable
- Decidability of string graphs
- A separator theorem for graphs of bounded genus
- The Minor Crossing Number
- A Separator Theorem for Planar Graphs
- Crossing-Free Subgraphs
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
- [https://portal.mardi4nfdi.de/wiki/Publication:4888117 The crossing number ofC5 �Cn]
- Improving the crossing lemma by finding more crossings in sparse graphs
- On the crossing numbers of Cartesian products with trees
- Topology of Thin Film RC Circuits
- Crossing Number Problems
- Recognizing string graphs in NP
This page was built for publication: General lower bounds for the minor crossing number of graphs
