MS (Master of Science)
Date of Award
Committee Chair or Co-Chairs
Robert A. Beeler, Robert B. Gardner
Let G be a graph. For k ≥ d ≥ 1, a k/d -coloring of G is a coloring c of vertices of G with colors 0, 1, 2, . . ., k - 1, such that d ≤ | c(x) - c(y) | ≤ k - d, whenever xy is an edge of G. We say that the circular chromatic number of G, denoted χc(G), is equal to the smallest k/d where a k/d -coloring exists. In , Pan and Zhu have given a function μ(g) that gives an upper bound for the circular-chromatic number for every K4-minor-free graph Gg of odd girth at least g, g ≥ 3. In , they have shown that their upper bound in  can not be improved by constructing a sequence of graphs approaching μ(g) asymptotically. We prove that for every odd integer g = 2k + 1, there exists a graph Gg ∈ G/K4 of odd girth g such that χc(Gg) = μ(g) if and only if k is not divisible by 3. In other words, for any odd g, the question of attainability of μ(g) is answered for all g by our results. Furthermore, the proofs  and  are long and tedious. We give simpler proofs for both of their results.
Thesis - Open Access
Holt, Tracy Lance, "On the Attainability of Upper Bounds for the Circular Chromatic Number of K4-Minor-Free Graphs." (2008). Electronic Theses and Dissertations. Paper 1916. https://dc.etsu.edu/etd/1916
Copyright by the authors.