On maximum differential graph coloring

Yifan Hu, Stephen Kobourov, Sankar Veeramoni

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations


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 coloring problem to that of k-Hamiltonian path. As computing the maximum differential coloring is NP-Complete, we describe an exact backtracking algorithm and a spectral-based heuristic. We also discuss lower bounds and upper bounds for the differential chromatic number for several classes of graphs.

Original languageEnglish (US)
Title of host publicationGraph Drawing - 18th International Symposium, GD 2010, Revised Selected Papers
Number of pages13
StatePublished - 2011
Event18th International Symposium on Graph Drawing, GD 2010 - Konstanz, Germany
Duration: Sep 21 2010Sep 24 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6502 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other18th International Symposium on Graph Drawing, GD 2010

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'On maximum differential graph coloring'. Together they form a unique fingerprint.

Cite this