1 paper
Arda Asik, Ibrahim Bugra Demir, Berker Demirel +2
Graph coloring is a fundamental problem in combinatorics with many applications in practice. In this problem, the vertices in a given graph must be colored by using the least numbe…