| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653848 | European Journal of Combinatorics | 2012 | 10 Pages |
Abstract
Furthermore, we extend this result by showing that the optimal solution for inserting multiple edges or vertices into a planar graph also approximates the crossing number of the resulting graph.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Markus Chimani, Petr HlinÄný, Petra Mutzel,