We examine the adjacency matrices of three-regular graphs representing
one-face maps. Numerical studies reveal that the limiting eigenvalue statistics
of these matrices are the same as those of much larger, and more widely studied
classes from Random Matrix Theory.