Crossing number additivity over edge cuts
From MaRDI portal
Publication:2444731
DOI10.1016/j.ejc.2013.02.002zbMath1285.05039OpenAlexW1987717724MaRDI QIDQ2444731
Jesús Leaños, Markus Chimani, Drago Bokal
Publication date: 11 April 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2013.02.002
Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) ⋮ On degree properties of crossing-critical families of graphs ⋮ Unnamed Item
Cites Work
- Additivity of the crossing number of graphs with connectivity 2
- A framework for solving VLSI graph layout problems
- On the crossing numbers of Cartesian products with paths
- On the sharpness of some results relating cuts and crossing numbers
- Non-planar core reduction of graphs
- Construction of crossing-critical graphs
- Crossing numbers of graph embedding pairs on closed surfaces
- Two maps on one surface
- Infinite families of crossing-critical graphs with prescribed average degree and crossing number
- On the Minimum Cut of Planarizations
- The Minor Crossing Number
- ON THE ADDITIVITY OF CROSSING NUMBERS OF GRAPHS
- Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
- On the crossing numbers of Cartesian products with trees
- Two maps with large representativity on one surface
- General lower bounds for the minor crossing number of graphs
This page was built for publication: Crossing number additivity over edge cuts