On Graph Fall-Colouring
Description
Graph fall-colouring is an intersection of graph colouring and graph domination, whereby we attempt to partition a graph into independent dominating sets. In this talk, we will see various results regarding this type of graph coloring, including constructions of fall-colourable graphs with certain predefined properties. Additionally, we will present some results, which suggest that fall-colouring may be useful in proving Hedetniemi's Conjecture.
This talk is Chris's Comprehensive Exam. The first hour is open to everyone.
Event Topic
Discrete Applied Math Seminar