We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 5n/2 segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane drawing ...

Objective. We examined how parents’ expectations about their infants’ crawling ability and crawling attempts in a locomotor task affect parenting choices about ensuring infants’ safety and providing appropriate challenges. Design. Mothers and fathers of 34 11-month-old infants adjusted a ramp to the steepest slopes they thought their infants could safely crawl down, would attempt to crawl down,...

We define the slope of a colored link in an integral homology sphere, associated to admissible characters on group. Away from certain singular locus, slope is rational function which can be regarded as multivariate gen