The maximum k-differential coloring problem

The maximum k-differential coloring problem

Given an n-vertex graph Gand two positive integers d, k is an element of 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...

Full description

Bibliographic Details
Main Authors: Bekos, Michael A., Kaufmann, Michael, Kobourov, Stephen G., Stavropoulos, Konstantinos, Veeramoni, Sankar
Other Authors: Department of Computer Science – University of Arizona, Tucson AZ, USA
Language:en
Published: ELSEVIER SCIENCE BV 2017
Subjects:
Differential coloring
Differential chromatic number
Online Access:http://hdl.handle.net/10150/626126
http://arizona.openrepository.com/arizona/handle/10150/626126

Internet

http://hdl.handle.net/10150/626126
http://arizona.openrepository.com/arizona/handle/10150/626126

Similar Items