In this talk, we will see how the notion of graph homomorphism generalizes the concept of coloring and help defining parameters such as clique number, independence number, chromatic number etc. for different types of graphs, such as, oriented graphs, signed graphs, colored mixed graphs etc.More importantly, we will see how these new concepts and works relate itself to the popularly known theories.
Seminar Room, School of Mathematical Sciences
Rama Krishna Mission Vivekananda University
Graph homorphisms and colorings