Abstract
The classical problem in Combinatorics and Graph Theory of coloring the vertices of a given graph properly using a prescribed number of colors, is considered. This paper describes an application of elementary linear algebra over a finite field of order q to this problem, where q is the number of available colors.
Recommended Citation
Jensen, Tommy Rene
(2015)
"Graph Coloring Using Linear Algebra,"
CNU Journal of Higher Education: Vol. 9:
Iss.
1, Article 8.
DOI: https://doi.org/10.70997/2546-1796.1118
Available at:
https://jhe.researchcommons.org/journal/vol9/iss1/8
COinS