On maximum differential graph coloring

DOI10.1007/978-3-642-18469-7_25zbMATH Open1314.05067OpenAlexW1520709705MaRDI QIDQ3073679FDOQ3073679

Authors: 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

Recommendations

• A note on maximum differential coloring of planar graphs
• The maximum k-differential coloring problem
• The maximum \(k\)-differential coloring problem
• Approximation results for the minimum graph coloring problem
• On minimizing the maximum color for the 1-2-3 conjecture

Mathematics Subject Classification ID

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

Cited In (7)

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

This page was built for publication: On maximum differential graph coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073679)