Finding monotone paths in edge-ordered graphs Original Research Article

An edge-ordering of a graph image is a one-to-one function image from image to a subset of the set of positive integers. A path image in image is called an image-ascent if image increases along the edge sequence of image. The height image of image is the maximum length of an image-ascent in image.