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.

Edge colouring is a fundamental concept in graph theory whereby colours are assigned to the edges of a graph such that no two adjacent edges share the same colour. This process is central to numerous ...

Consider an urn model where at each step one of q colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns ...

Jacob, Jobby. "Rankings (ordered colorings) of Graphs." Math. Colloquium. Hobart and William Smith Colleges. Geneva, NY. 11 Apr. 2019. Keynote Speech. Dobosh, Korrine, Samuel Kennedy, and Jobby Jacob.

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. Four years ago, the mathematician Maria Chudnovsky faced an all-too ...

Color can make it easier for people to identify important information, such as legends on an Excel graph. Professional designers learn to use color coding effectively to make websites, applications ...