We will model a slackline park with graphs. We are modeling the flow of the slackers through the park with Euler Paths. We will show that with certain graphs with n vertices there exist n - 1 unique Euler Paths where no edge of a path coincides, in sequencing, with another edge of any of the remaining n - 2 paths.
