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.

Graph colouring remains a central topic in graph theory, providing the mathematical framework for assigning colours to the elements of a graph under specific constraints. In particular, the colouring ...

For a given set M of positive integers, a well-known problem of Motzkin asked to determine the maximal asymptotic density of M-sets, denoted by μ(M), where an M-set is a set of non-negative integers ...