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.

Let G = (V, E) be a strongly connected, aperiodic, directed graph having outdegree 2 at each vertex. A red-blue coloring of G is a coloring of the edges with the ...

A year after he started his Ph.D. in mathematics at McGill University, Matt Bowen had a problem. “I took my qualifying exams and did absolutely horribly on them,” he said. Bowen was sure that his ...

Embed <iframe src="https://www.npr.org/player/embed/4254287/4254288" width="100%" height="290" frameborder="0" scrolling="no" title="NPR embedded audio player"> NPR's ...