A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The Maximum k-Differential Coloring Problem
[article]

2014
*
arXiv
*
pre-print

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)-differential colorable is NP-complete, our main contribution is a complete characterization of bipartite,

arXiv:1409.8133v2
fatcat:qxnv4t6qqfbznj3rsvwzolb3k4