28 search results - page 2 / 6 » Coloring the Cartesian sum of graphs |
DM
2008
15 years 3 months ago
2008
128
click to vote
DAM
2010
15 years 3 months ago
2010
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...
111
click to vote
CC
2006
Springer
15 years 3 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
138
click to vote
DAM
2007
15 years 3 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
149
Voted
DAM
2011
14 years 10 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...