There are several different notions of snake graphs. In combinatorics snakes are finite subgraphs of the square grid formed by taking a union of cells, where a cell consists of four cyclically connected vertices of the grid and the edges that join them, and where the cells that form a snake can be ordered in a linear fashion, so that each cell is either immediately to the right of or immediately above the preceding cell.
