Crossing Number and Weighted Crossing Number of Near-Planar Graphs

@article{Cabello2009CrossingNA,
  title={Crossing Number and Weighted Crossing Number of Near-Planar Graphs},
  author={Sergio Cabello and Bojan Mohar},
  journal={Algorithmica},
  year={2009},
  volume={60},
  pages={484-504}
}
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from different combinatorial viewpoints. On the one hand, we develop min-max formulas involving efficiently computable lower and upper bounds. These min-max results are the first of their… CONTINUE READING