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.

As an undergraduate at the University of Chile, Bernardo Subercaseaux took a dim view of using computers to do math. It seemed antithetical to real intellectual discovery. “There’s some instinct or ...

One of the great episodes in the history of mathematics began on October 23, 1852. In a letter to Sir William Rowan Hamilton, Augustus De Morgan wrote, “A student of mine asked me today to give him a ...

For years, a simple question has haunted Máté Matolcsi, a professor at the Budapest University of Technology and Economics. How much of an infinite plane can you color in while making sure that no two ...

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 colors red and blue such that each ...

Have you ever tried to do the brainteaser below, where you have to connect the dots to make the outline of a house in one continuous stroke without going back over your lines? Or perhaps you've ...