Abstract The Graph Coloring Problem (GCP) can be simply defined as partitioning the
vertices of a graph into independent sets while minimizing the number of colors used. So far …

This study presents a widely applicable approach to accelerate the computation time of the
Branch-and-Price (BaP) algorithm, which is a very powerful exact method used for solving …

Locally harmonious colouring is a relaxed version of standard harmonious colouring which
only needs that the colour pairs for adjacent edges are different. In this work, we introduce …

We propose several formulations of the fixed interval scheduling problem under uncertainty,
where the risk is represented by random delays in processing times. We employ various …

Given an undirected simple graph G, an integer k, and a cost cij for each pair of non-
adjacent vertices in G, a robust coloring of G is the assignment of k colors to vertices such …

Given a directed graph with weights on the vertices and on the arcs, a θ-improper k-coloring
is an assignment of at most k different colors to the vertices of G such that the weight of every …

In this work, we present a branch-and-price algorithm to solve the weighted version of the
List Coloring Problem, based on a vertex cover formulation by stable sets. This problem is …

A rainbow cycle in an undirected edge‐colored graph is a cycle in which all edges have
different colors. A rainbow cycle cover of a graph is a set of disjoint rainbow cycles, where …

In this paper, we conduct research on the novel spectrum allocation algorithm based on the
graph coloring. Today, with the constant development of wireless communication …

Many variations of the classical graph coloring model have been intensively studied due to
their multiple applications; scheduling problems and aircraft assignments, for instance …