On the chromatic number of disk graphs

Networks

Volumn 32, Issue 1, 1998, Pages 13-22

  Malesinska, Ewa ^a   Piskorz, Steffen ^b   Weißenfels, Gerhard ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041175842     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199808)32:1<13::AID-NET2>3.0.CO;2-M     Document Type: Article

References (17)

1. R. Bar-Yehuda and S. Even, A local-ratio theorem for approximating the weighted vertex cover problem. Ann. Discr. Math. 25 (1985) 27-45.
2. H. Breu and D. G. Kirkpatrick, Unit disk graph recognition is NP-hard. Technical Report 93-27. Department of Computer Science, University of British Columbia (1993). CGTA: Computational Geometry: Theory and Applications 9 (1998).
3. B. N. Clark, C. J. Colbourn, and D. S. Johnson, Unit disk graphs. Discr. Math. 86 (1990) 165-177.
4. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Computer Science and Applied Mathematics. Academic Press, New York (1980).
5. A. Gräf, Coloring and recognizing special graph classes. PhD Thesis, Johannes Gutenberg-Universität Mainz, Germany (1994). Published as Report No. 20/95 in the series Musikinformatik und Medientechnik.
6. A. Gräf, M. Stumpf, and G. Weißenfels, On coloring unit disk graphs. Algorithmica, 20 (1998) 277-293.
7. A. Gräf, M. Stumpf, and G. Weißenfels, On coloring unit disk graphs. Musikinformatik und Medientechnik 17/94. Johannes Gutenberg-Universität Mainz, Musikwissenschaftliches Institut, Bereich Musikinformatik (1994).
8. H. Grötzsch, Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. 8 (1959) 109-120.
9. W. Hale, Frequency assignment: Theory and applications. Proc. IEEE 68 (1980) 1497-1514.
10. H. B. Hunt III, M. V. Marathe, V. Radakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns, A unified approach to approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Proceedings of the 2nd European Symposium on Algorithms (ESA '94). LNCS 885 (1994) 424-435.
11. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems. J. ACM 41 (1994) 960-981.
12. E. Malesińska, Graph-theoretical models for frequency assignment problems. PhD Thesis, Department of Mathematics, TU Berlin (1997); Shaker Verlag, Aachen (1997).
13. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz, Simple heuristics for unit disk graphs. Networks 25 (1995) 59-68.
14. D. W. Matula and L. L. Beck, Smallest-last ordering and clustering and graph coloring algorithms. J. Assoc. Comput. Mach. 30 (1983) 417-427.
15. R. H. Möhring, Algorithmic aspects of comparability graphs and interval graphs. Graphs and Orders (I. Rival, Ed.). D. Reidel (1985) 41-101.
16. R. Peeters, On coloring j-unit sphere graphs. FEW 512, Department of Economics, Tilburg University, The Netherlands (1991).
17. H. Sachs, Coin graphs, polydedra, and conformal mapping. Discr. Math. 134 (1994) 133-138.