Unlabelled graphs on n vertices can be generated uniformly at random, without calculating the total numbers of such graphs, but using asymptotic enumeration results. For large n the process is very efficient, taking O(n 2) steps on average. By similar methods one can generate random unlabelled graphs with n vertices and m edges in expected time for most values of m. Also random unlabelled r-regular graphs can be generated in expected time O(n) when \(r\geq 3\) is fixed.