Sciweavers

208 search results - page 1 / 42
» Improved upper bounds on the crossing number
Sort
View
COMPGEOM
2008
ACM
13 years 5 months ago
Improved upper bounds on the crossing number
Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar...
ALGORITHMICA
2011
12 years 10 months ago
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
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 diffe...
Sergio Cabello, Bojan Mohar
GD
2008
Springer
13 years 4 months ago
Crossing and Weighted Crossing Number of Near-Planar Graphs
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 di...
Sergio Cabello, Bojan Mohar
DM
2008
104views more  DM 2008»
13 years 3 months ago
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for...
Florent R. Madelaine, Iain A. Stewart
COMPGEOM
2005
ACM
13 years 5 months ago
Abstract order type extension and new results on the rectilinear crossing number
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
Oswin Aichholzer, Hannes Krasser