Encoding
Maurice Clerc · 2024
Before delving into the study of algorithms for finding an optimal coloring, it is necessary to mathematically formalize the problem. Specifically, one must define codes to represent the entities involved: the graphs, with their arcs and nodes, and the colorings. By using such codes, it will be possible to write computer programs to solve the problem. Several methods are explained, even though not all of them will be used later on. Emphasis is placed on binary encodings because they are most suitable for the quantum algorithm that will be discussed later.