@misc {IOPORT.04095487,
    author       = {Archdeacon, Dan},
    title        = {Calculations on the average genus and genus distribution of graphs.},
    howpublished = {Combinations, graph theory, and computing, Proc. 19th Southeast. Conf., Boca Raton/Fla. 1988, Congr. Numerantium 67, 114-124 (1988).},
    year         = {1988},
    abstract     = {[For the entire collection see Zbl 0665.00002.] This is a paper in the blossoming field of random topological graph theory. The author imposes the uniform distribution on the sample space of all orientable 2-cell imbeddings of a fixed connected cubic graph, and then studies the distribution and the expected value of the genus random variable on this sample space. Two methods of calculation are employed: (1) a divide and conquer algorithm determines graph imbeddings from certain subgraph imbeddings; (2) calculations determine the probability of a cycle being a face boundary in an imbedding, learning to the determination of the expected number of faces and hence the expected value of the genus random variable. Some computer results are given, including charts of the genus distribution for four cubic graphs of order 96. The author concludes with several questions for further study.},
    reviewer     = {A.T.White},
    identifier   = {04095487},
}