Local 7-coloring for planar subgraphs of unit disk graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4978 LNCS, Issue , 2008, Pages 170-181

  Czyzowicz, J ^a   Dobrev, S ^b   Gonzalez Aguilar H ^c   Kralovic, R ^d   Kranakis, E ^e   Opatrny, J ^f   Stacho, L ^g   Urrutia, J ^h  

^a UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^b INSTITUTE OF CHEMISTRY   (Slovakia)

^c CENTRO DE INVESTIGACIÓN EN MATEMÁTICAS   (Mexico)

^d Faculty of Natural Sciences   (Slovakia)

^e CARLETON UNIVERSITY   (Canada)

^f Dept of Electrical and Computer Engineering   (Canada)

^g SIMON FRASER UNIVERSITY   (Canada)

^h UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPH ALGORITHMS; GRAPHIC METHODS; INFORMATION USE;

NUMBER OF HOPS; PLANAR GRAPH; PLANAR SUBGRAPHS; SIMPLE ALGORITHM; SUBGRAPHS; UNIT DISK GRAPHS;

GRAPH THEORY;

EID: 70349330653     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79228-4_15     Document Type: Conference Paper

References (14)

1. Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. wireless networks 7, 609-616 (2001)
2. Caragiannis, I., Fishkin, A.V., Kaklamanis, C., Papaioannou, E.: A tight bound for online coloring of disk graphs. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 78-88. Springer, Heidelberg (2005)
3. Chavez, E., Dobrev, S., Kranakis, E., Opatrny, J., Stacho, L., Urrutia, J.: Local construction of planar spanners in unit disk graphs with irregular transmission ranges. In: Cardoso, J., Sheth, A.P. (eds.) SWSWPC 2004. LNCS, vol. 3387, pp. 286-297. Springer, Heidelberg (2005)
4. Dörre, P.: Every planar graph is 4-colourable and 5-choosable a joint proof. Fachhochschule Südwestfalen (University of Applied Sciences) (unpublished note)
5. Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis. Systemic Zoology 18, 259-278 (1972)
6. Ghosh, S., Karaata, M.H.: A self-stabilizing algorithm for coloring planar graphs. Distributed Computing 7, 55-59 (1993)
7. Gräf, A., Stumpf, M., Weißenfels, G.: On coloring unit disk graphs. Algorithmica 20(3), 277-293 (1998)
8. Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. of 11th Canadian Conference on Computational Geometry, August 1999, pp. 51-54 (1999)
9. Linial, N.: Locality in distributed graph algorithms. SIAM J. COMP. 21(1), 193-201 (1992)
10. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25(1), 59-68 (1995)
11. Miyamoto, Y., Matsui, T.: Multicoloring unit disk graphs on triangular lattice points. In: SODA, pp. 895-896. SIAM, Philadelphia (2005)
12. Thomassen, C.: Every planar graph is 5-choosable. Combinatorial Theory Series B 62(1), 180-181 (1994)
13. Tuza, Z., Voigt, M.: A note on planar 5-list colouring: non-extendability at distance 4. Discrete Mathematics 251(1), 169-172 (2002)
14. Wang, Y., Li, X.-Y.: Localized construction of bounded degree and planar spanner for wireless ad hoc networks. In: DialM: Proceedings of the Discrete Algorithms and Methods for Mobile Computing & Communications (2003)