Abstract. Instead of coloring graphs in the usual way, we look at assigning vectors to the vertices so that adjacent vertices have orthogonal vectors. This concept has arisen in many problems in geometry and graph theory, but there are still more questions than answers. In addition to exploring these problems, we will define two linear algebra analogues of list coloring and present some results and open problems from research this summer.