Joshua Chester, Linnea Edlin, Jonah Galeota-Sprung,
Bradley Isom, Alexander Moore, Virginia Perkins, A. Malcolm
Campbell, Todd T. Eckdahl, Laurie J. Heyer and Jeffrey L.
Poet
In this paper, we introduce two special classes of digraphs. A limited
outdegree grid (LOG) directed graph is a digraph derived from an
grid
graph by removing some edges and replacing some edges with arcs such
that no vertex has outdegree greater than 1. A greatest increase grid (GIG)
directed graph is a LOG digraph whose vertices can be labeled with distinct
labels such that each arc represents the direction of greatest increase in the
underlying grid graph. We enumerate both GIG and LOG digraphs for the
case.