The weighted graph coloring problem (WGCP) is an important extension of the graph
coloring problem (GCP) with wide applications. Compared to GCP, where numerous …

Given a vertex-weighted graph G=(V, E; w), w (v)⩾ 0 for any v∈ V, we consider a weighted
version of the coloring problem which consists in finding a partition S=(S1,…, Sk) of the …

The paper addresses the combinatorial problem of edge colored clustering in graphs. A brief
structured survey on the problems and their applications in communication networks and …

Given a graph G=(V, E) and positive integral vertex weights w: V→ N, the max-coloring
problem seeks to find a proper vertex coloring of G whose color classes C 1, C 2,..., C k …

The weighted graph coloring problem (WGCP) is a well-known NP-hard combinatorial
optimization problem with various practical applications. Due to its theoretical significance …

We study interval coloring problems and present new upper and lower bounds for several
variants. We are interested in four problems, online coloring of intervals with and without …

First-fit is the online graph coloring algorithm that considers vertices one at a time in some
order and assigns each vertex the least positive integer not used already on a neighbor. The …

In this article we resort to the copula theory and CVaR measures in the portfolio
management, using copula function and copula-CVaR to design the portfolio optimization …

Given a graph G, we construct an auxiliary graph G̃ with m¯ vertices such that the set of all
stable sets of G̃ is in one-to-one correspondence with the set of all colorings of G. Then, we …

We study complexity and approximation of min weighted node coloring in planar, bipartite
and split graphs. We show that this problem is NP-hard in planar graphs, even if they are …