Orthogonal Vector Coloring

Gerald Haynes, Catherine Park, Amanda Schaeffer, Jordan Webster, Lon H. Mitchell

Abstract


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 chromatic numbers and characterize all graphs that have (vector) chromatic number two in each case.


Full Text: PDF