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.

The study of graph colouring has long been a central topic in discrete mathematics, with a prominent focus on optimising the assignment of labels or colours to vertices such that adjacent vertices are ...

Let G be a graph and k a natural number. A k-coloring of G is a map c that maps the vertices of G into the set {1, 2, ..., k} (whose elements are called colors) such that no two adjacent vertices are ...