Sciweavers

592 search results - page 7 / 119
» Crossing numbers of random graphs
Sort
View
GD
2007
Springer
14 years 2 months ago
Improvement on the Decay of Crossing Numbers
We prove that the crossing number of a graph decays in a “continuous fashion” in the following sense. For any ε > 0 there is a δ > 0 such that for n sufficiently large...
Jakub Cerný, Jan Kyncl, Géza T&oacut...
ARSCOM
2004
124views more  ARSCOM 2004»
13 years 7 months ago
The Domatic Number of Regular Graphs
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
Peter Dankelmann, Neil J. Calkin
GD
2006
Springer
13 years 11 months ago
On the Decay of Crossing Numbers
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
Jacob Fox, Csaba D. Tóth