On Maximum Differential Graph Coloring

DOI10.1007/978-3-642-18469-7_25zbMath1314.05067OpenAlexW1520709705MaRDI QIDQ3073679

Yifan Hu, Stephen G. Kobourov, Sankar Veeramoni

Publication date: 11 February 2011

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18469-7_25

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The maximum \(k\)-differential coloring problem ⋮ Minimum gradation in greyscales of graphs ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Antibandwidth and cyclic antibandwidth of Hamming graphs ⋮ A note on maximum differential coloring of planar graphs ⋮ Contrast in greyscales of graphs