Given a graph G=(V, E) G=(V,E) and a subset of its vertices V′⊆ VV^′⊆V, the subgraph
induced by V′ V^′ in G is that with vertex set V′ V^′ and edge set E′ E^′ formed by …

The Master Surgery Scheduling Problem (MSSP) allocates operating theatre time to surgery
groups such as medical specialities or surgeons, which is essential for daily operational …

The minimum k-dominating set (MKDS) problem, an extension of the classical minimum
dominating set problem, is a famous combinatorial optimization problem with a wide range …

Given a simple graph G=(V, E) and a real constant γ∈(0, 1], a γ-clique (or γ-quasi-clique) is
a subset V′⊆ V inducing a subgraph with edge density at least γ. The minimum quasi …

Given a simple undirected graph G, its Grundy chromatic number Γ (G)(or Grundy number)
defines the worst-case behavior for the well-known and widely-used greedy first-fit coloring …

B-coloring is a theoretical optimization problem on a graph that, on top of being used to
model some real-world applications, is exploited by some bounding techniques embedded …

Given a graph G=(V, E), a connected Grundy coloring is a proper vertex coloring that can be
obtained by a first-fit heuristic on a connected vertex sequence. A first-fit coloring heuristic is …

Abstract Let $ G=(V, E) $ be a simple, connected and un-directed graph. Given that a map $
f: E (G)\longrightarrow\{1, 2, 3,\dots,| E (G)|\} $. We define a vertex weight of $ v\in V $ as $ w …

B-coloring is a problem in graph theory at the basis of several real applications and also
used to improve solution methods for the classical coloring problem. Enhanced solutions for …

B-coloring is a problem in graph theory. It can model some real applications, as well as
being used to enhance solution methods for the classical graph coloring problem. In turn …