In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-...
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with + 2 colors, where is the maximum degree of a graph. Although this conjecture was solved in ...
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...