Introduction to Signed Graph Colorings

How do we color signed graphs? This video introduces Zaslavsky's approach to signed graph colorings with several examples. Signed graph coloring consists of labeling the vertices of a signed graph with integers, where a k-coloring is taken to mean a coloring with labels drawn from the set of integers with magnitude less than or equal to k. Vertices linked by a positive edge must be assigned distinct integers, vertices linked by a negative edge must not be assigned additive inverse integers. Signed graph colorings have applications to scheduling much like graph colorings do, and they allow us to tackle new kinds of problems.

Thanks for watching! Here are some links for further exploration:

https://www.sciencedirect.com/science/article/pii/0012365X82901443

https://www.sciencedirect.com/science/article/abs/pii/S0195669820301475 ... https://www.youtube.com/watch?v=w3XfocCeG30