On Chen-Lih-Wu Conjecture for planar graphs

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.

Name thesis:degree_name

M.S.

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Applied Mathematics

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2023

Author dc:creator

• Lin, Duo

Contributors dc:contributor

• Kostochka, Alexandr

• Equitable Coloring
• Planar Graphs

Statement dc:rights

• Copyright 2023 Duo Lin

Language dc:language

en, eng

Handle dc:identifier

https://hdl.handle.net/2142/121920

OAI record oai:identifier

https://www.ideals.illinois.edu/oai-pmh?verb=GetRecord&metadataPrefix=etdms&identifier=oai%3Awww.ideals.illinois.edu%3A2142%2F121920