We define k-monotone drawings, where paths are monotone in one of k directions. We prove that a graph admits a 1-monotone drawing if and only if it can be made Hamiltonian by adding at most one edge. We prove that maximal planar graphs admit 2-monotone drawings. We prove that triconnected planar graphs admit 3-monotone drawings.