- This event has passed.
Boram Park (박보람), Odd coloring of sparse graphs
Monday, April 25, 2022 @ 4:30 PM - 5:30 PM KST
Room B232, IBS (기초과학연구원)
We introduce an odd coloring of a graph, which was introduced very recently, motivated by parity type colorings of graphs. A proper vertex coloring of graph $G$ is said to be odd if for each non-isolated vertex $x \in V (G)$ there exists a color $c$ such that $c$ is used an odd number of times in the neighborhood of $x$. The recent work on this topic will be presented, and the work is based on Eun-Kyung Cho, Ilkyoo Choi, and Hyemin Kown.