A vector coloring of a graph is an assignment of a vector to each vertex where the presence or absence of an edge between two vertices dictates the value of the inner product of the corresponding vectors. In this paper, we obtain results on orthogonal vector coloring, where adjacent vertices must be assigned orthogonal vectors. We introduce two vector analogues of list coloring along with their chro- matic numbers and characterize all graphs that have (vector) chromatic number two in each case. In this paper, we define and explore possible vector-space analogues of the list- chromatic number of a graph. The first section gives basic definitions and terminology related to graphs, vector representations, and coloring. Section 2 introduces vector coloring and the corresponding definitions of the list-vector and subspace chromatic numbers of a graph and presents some results and related problems. In the final section, we characterize all graphs that have chromatic number two in each case.