Graph colouring is one of those rare examples in the mathematical sciences of a problem
that, while easy to state and visualise, has many aspects that are exceptionally difficult to …

Given an undirected graph G=(V, E), the Vertex Coloring Problem (VCP) requires to assign a
color to each vertex in such a way that colors on adjacent vertices are different and the …

We consider two approaches for solving the classical minimum vertex coloring problem—
that is, the problem of coloring the vertices of a graph so that adjacent vertices have different …

This paper explores techniques for solving the maximum clique and vertex coloring
problems on very large-scale real-life networks. Because of the size of such networks and …

The best method known for determining lower bounds on the vertex coloring number of a
graph is the linear-programming column-generation technique, where variables correspond …

This paper describes a new exact algorithm PASS for the vertex coloring problem based on
the well known DSATUR algorithm. At each step DSATUR maximizes saturation degree to …

Given a graph whose vertex set is partitioned, the partition coloring problem (PCP) requires
the selection of one vertex from each partite set, such that the subgraph induced by the set of …

The graph coloring problem (GCP) is one of the most studied NP hard problems and has
numerous applications. Despite the practical importance of GCP, there are limited works in …

The vertex coloring problem asks for the minimum number of colors that can be assigned to
the vertices of a given graph such that each two neighbors have different colors. The …

The widespread adoption of 5G cellular technology will evolve as one of the major drivers
for the growth of IoT-based applications. In this paper, we consider a Service Provider (SP) …