Graph labeling is a central topic in combinatorial optimisation that involves assigning numerical or categorical labels to vertices or edges of a graph subject to specific constraints. This framework ...

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.

“Rainbow colorings” recently led to a new proof. It’s not the first time they’ve come in handy. Recently, Quanta reported on the new solution to a problem called Ringel’s conjecture. Part of the proof ...