Abstract
We study the problem of minimizing the number of colors for vertex-coloring of double disk graphs and in this note, show a polynomial-time 31-approximation for the problem, which improves an existing result.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Clark, B.N., Colbourn, C.J. and Johnson, D.S. (1990), Unit disk graphs, Discrete Mathematics 86, 165–177.
Gräf, A., Stumpf, M. and Weißenfels, G. (1998), On coloring unit disk graphs, Algorithmica 20, 277–293.
Malesinska, E., Piskorz, S. and Weißenfels, G. (1998), On the chromatic number of disk graphs, Networks 32. 13–22
Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S. and Rosenkrantz, D.J. (1995), Simple heuristics for unit disk graphs, Networks 25, 59–68.
Peeters, R. (1991), On coloring j-unit sphere graphs, Tilburg University, Tilburg, The Netherlands.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Du, H., Jia, X., Li, D. et al. Coloring of Double Disk Graphs. Journal of Global Optimization 28, 115–119 (2004). https://doi.org/10.1023/B:JOGO.0000006750.85332.0f
Issue Date:
DOI: https://doi.org/10.1023/B:JOGO.0000006750.85332.0f