Date of Award
8-1-2024
Degree Name
Master of Science
Department
Mathematics
First Advisor
Calvert, Wesley
Abstract
In this paper, we introduce two new variations on the computable chromatic number: the computable list chromatic number and the computable coloring number. We show that, just as with the non-computable versions, the computable chromatic number is always less than or equal to the computable list chromatic number, which is less than or equal to the computable coloring number.We investigate the potential differences between the computable and non-computable chromatic, list chromatic, and coloring numbers on computable graphs. One notable example is a computable graph for which the coloring number is 2, but the computable chromatic number is infinite.
Access
This thesis is Open Access and may be downloaded by anyone.