This research topic explores the theoretical foundations and practical applications of graph labeling and coloring problems, both of which are central to modern combinatorics and computer science.

constraint satisfaction problems, or CSPs for short, are a flexible approach to searching that have proven useful in many AI-style problems CSPs can be used to solve problems such as graph-coloring: ...