Topics to be covered include: Brief Introduction to discrete mathematics and graph theoretic terminology; Ramsey's Theorem; matchings and Hall's Theorem; graph search algorithms; stable marriages and ...

The study of graph colouring has long been a central topic in discrete mathematics, with a prominent focus on optimising the assignment of labels or colours to vertices such that adjacent vertices ...

Ko-Wei Lih, 李國偉, Wei-Fan Wang, 王維凡, COLORING THE SQUARE OF AN OUTERPLANAR GRAPH, Taiwanese Journal of Mathematics, Vol. 10, No. 4 (June 2006), pp. 1015-1023 ...

Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite differences or automatic differentiation. Several coloring problems ...

Possible formal publication "Tattooing is a newly-defined graph colouring approach that allows colours to mix as discrete objects within certain mathematical rules." According to Kok, who has a PhD in ...

This course provides an introduction to discrete mathematics, particularly graph theory. Emphasis will be placed on the algorithmic aspects of the area.