Kính gửi đến Quý thầy cô, nghiên cứu sinh, học viên cao học và sinh viên thông tin về seminar Toán học tháng 04/2023
Title: Packing colourings in graphs; state of today and further challenges
Speaker: Dr. Stijn Cambie, Postdoctoral Researcher (The Institute for Basic Science (IBS), Korea)
Graph coloring is an elementary concept with a wide range of applications, including scheduling, resource allocation, optimizing the efficiency of computer processors, and minimizing the number of tracks in train stations, among others. However, there are numerous challenges associated with graph coloring that can be difficult in various ways.
Not only specific instances are known to be NP-complete, but also seemingly intuitive questions turn out to be harder than expected.
Applications of graph colouring often involve taking restrictions into account, and it is desirable to have multiple (disjoint) solutions. In the optimal case, where there is a partition into disjoint colourings, we speak of a packing.
The concept of packing colourings is rather new.
In this talk, we mention the start of the art, and present potential interesting directions for the future.