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 ...
Four years ago, the mathematician Maria Chudnovsky faced an all-too-common predicament: how to seat 120 wedding guests, some of whom did not get along, at a dozen or so conflict-free tables. Luckily, ...
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 ...
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.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results