Graph Coloring
Abstract: A proper coloring of a graph is an assignment of colors to the vertices of the graph such that no two adjacent vertices receive the same color. Graph coloring is a classical subject in Graph Theory which contains many challenging problems. The famous Four-Color Theorem which stood as an unsolved problem for over a century says that every planar graph has a proper 4-coloring. Graph coloring has also numerous applications to real world problems such as scheduling and timetabling. In this talk, I will discuss some graph coloring results, problems and applications.
This talk is appropriate for faculty, undergraduate students, and a more general audience.
Biography: Dr. Aysel Erey is an assistant professor in the Department Mathematics and Statistics at Utah State University. She received her Ph.D. from Dalhousie University in Canada. Her research interests are in the area of Graph Theory.
Contact: aysel.erey@usu.edu