Director of Research (if dissertation) or Advisor (if thesis)
Kostochka, Alexandr
Department of Study
Mathematics
Discipline
Applied Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S.
Degree Level
Thesis
Keyword(s)
equitable coloring, planar graphs
Abstract
The Chen-Lih-Wu Conjecture states that for a connected graph with maximum degree ∆, there is an equitable ∆-coloring if the graph is not a complete graph, an odd cycle or K_{∆,∆}. In this thesis, we study the above conjecture on planar graphs. The first chapter provides a
literature review of recent developments. The second chapter provides a new proof that the Chen-Lih-Wu Conjecture holds for planar graphs with maximum degree ∆ ≥ 9.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
