Sex differences in the play behavior of prepubescent rats

It is demonstrated that in the rat, as in primates, perinatal exposure to testicular androgens influences the development of patterns of play behavior.

Abstract

A natural way to draw two planar graphs whose vertex sets are matched is to assign each matched pair a unique y-coordinate. In this paper we introduce the concept of such matched drawings, which are a relaxation of simultaneous geometric embeddings with mapping. We study which classes of graphs allow matched drawings and show that (i) two 3-connected planar graphs or a 3-connected planar graph and a tree may not be matched drawable, while (ii) two trees or a planar graph and a planar graph of some special families—such as unlabeled level planar (ULP) graphs or the family of "carousel graphs"—are always matched drawable. \nResearch partially supported by the MIUR Project "MAINSTREAM: Algorithms for massive information structures and data streams".