Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence, ...

Abstract: The graph colouring problem is a NP- class problem explored in the literature due to its numerous applications in real world Engineering problems. Graph colouring problem involves to assign ...

Change numColors to your grid size. The grid size should be a perfect square. For example, 4, 9, 16, 25 works. The higher up, the more complex and longer compute times. Change solved to the initial ...

Let G be a graph and k a natural number. A k-coloring of G is a map c that maps the vertices of G into the set {1, 2, ..., k} (whose elements are called colors) such that no two adjacent vertices are ...

Project title: Grover’s algorithm for solving the graph coloring problem Project description: This project applies Grover’s quantum search algorithm to the graph coloring problem using the Four Color ...

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, ...

Maria you are giving the annual Hamilton Lecture soon in Dublin, what will you talk about? I will talk about simple problems or puzzles that relate to parties, doughnuts and colouring and explain how ...