The maximum k -differential coloring problem
نویسندگان
چکیده
منابع مشابه
The Maximum k-Differential Coloring Problem
Given an n-vertex graph G and two positive integers d, k ∈ N, the (d, kn)-differential coloring problem asks for a coloring of the vertices of G (if one exists) with distinct numbers from 1 to kn (treated as colors), such that the minimum difference between the two colors of any adjacent vertices is at least d. While it was known that the problem of determining whether a general graph is (2, n)...
متن کاملOn Maximum Differential Graph Coloring
Abstract. We study the maximum differential graph coloring problem, in which the goal is to find a vertex labeling for a given undirected graph that maximizes the label difference along the edges. This problem has its origin in map coloring, where not all countries are necessarily contiguous. We define the differential chromatic number and establish the equivalence of the maximum differential c...
متن کاملThe maximum edge q-coloring problem
We consider the problem of coloring edges of a graph subject to the following constraints: for every vertex v, all the edges incident with v have to be colored with at most q colors. The goal is to find a coloring satisfying the above constraints and using the maximum number of colors. Notice that the notion of coloring is different than in the classical edge coloring problem, as neighboring ed...
متن کاملOn Maximum Differential Coloring of Planar Graphs
We study the maximum differential coloring problem, where the vertices of an n-vertex graph must be labeled with the numbers 1, ..., n such that the minimum difference between the two labels of any adjacent vertices is maximized. As it is NP-hard to find the optimal labels for general graphs, we consider special sub-classes: caterpillars, spiders, and extended stars. We first prove new upper bo...
متن کاملOn the approximability of the maximum interval constrained coloring problem
In the Maximum Interval Constrained Coloring problem, we are given a set of intervals on a line and a k-dimensional requirement vector for each interval, specifying how many vertices of each of k colors should appear in the interval. The objective is to color the vertices of the line with k colors so as to maximize the total weight of intervals for which the requirement is satisfied. This NP-ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2017
ISSN: 1570-8667
DOI: 10.1016/j.jda.2017.08.001