Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

55

Voted

DCG
2010

favoriteEmaildiscussreport

93views more DCG 2010»

General Lower Bounds for the Minor Crossing Number of Graphs

14 years 9 months ago

General Lower Bounds for the Minor Crossing Number of Graphs

Download www.imfm.si

Drago Bokal, Éva Czabarka, Lászl&oac

Real-time Traffic

DCG 2010 |

claim paper

Related Content

» Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor

» On the rectilinear crossing number of complete graphs

» On crossing numbers of geometric proximity graphs

» CrossComposition A New Technique for Kernelization Lower Bounds

» Complete Minors and Independence Number

» Crossing Number and Weighted Crossing Number of NearPlanar Graphs

» Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface

» A central approach to bound the number of crossings in a generalized configuration

» kSets Convex Quadrilaterals and the Rectilinear Crossing Number of Kn

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	DCG
Authors	Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrt'o

Comments (0)