Orthogonal Vector Coloring

Authors

Gerald Haynes
Catherine Park
Amanda Schaeffer
Jordan Webster
Lon Mitchell, University of South Florida St. PetersburgFollow

SelectedWorks Author Profiles:

Lon Mitchell

Document Type

Article

Publication Date

2010

ISSN

1077-8926

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.

Recommended Citation

Haynes, G., Park, C., Schaeffer, A., Webster, J. & Mitchell, L. (2010). Orthogonal vector coloring. The Electronic Journal of Combinatronics, 17(1), R55, 18. https://doi.org/10.37236/327.