Coloring powers of planar graphs

SIAM Journal on Discrete Mathematics

Volumn 16, Issue 4, 2003, Pages 651-662

  Agnarsson, Geir ^a   Halldórsson, Magnús M ^b  

^a GEORGE MASON UNIVERSITY   (United States)

^b UNIVERSITY OF ICELAND   (Iceland)

Author keywords

Distance 2 coloring; Radio coloring

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

HESSIAN MATRICES; PLANAR GRAPHS; RADIO COLORING; SZEKERES-WILF NUMBER;

GRAPH THEORY;

EID: 0242526025     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100367950     Document Type: Article

References (20)

1. G. Agnarsson and M. M. Halldórsson, Coloring powers of planar graphs, in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2000, pp. 654-662.
2. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM, 41 (1994), pp. 153-180.
3. H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, in Theoret. Comput. Sci., 209 (1998), pp. 1-45.
4. R. Diestel, Graph Theory, Graduate Texts in Math. 173, Springer-Verlag, Berlin, 1997.
5. P. Heggernes and J. A. Telle, Partitioning graphs into generalized dominating sets, Nordic J. Comput., 5 (1998), pp. 128-143.
6. J. van den Heuvel and S. McGuinness, Colouring the Square of a Planar Graph, Research Report LSE-CDAM-99-06, Centre for Discrete and Applicable Mathematics, London, UK, 1999.
7. S. Jendrol' and Z. Skupień, Local structures in plane maps and distance colourings, Discrete Math., 236 (2001), pp. 167-177.
8. T. R. Jensen and B. Toft, Graph Coloring Problems, 1995. Wiley Interscience, 1995. Archives available online at http://www.imada.sdu.dk/Research/Graphcol/.
9. A. Kotzig, Extremal polyhedral graphs, Ann. New York Acad. Sci., 319 (1979), pp. 569-570.
10. S. O. Krumke, M. V. Marathe, and S. S. Ravi, Approximation algorithms for channel assignment in radio networks, Wireless Networks, 7 (2001), pp. 575-584.
11. Y.-L. Lin and S. S. Skiena, Algorithms for square roots of graphs, SIAM J. Discrete Math., 8 (1995), pp. 99-118.
12. E. L. Lloyd and S. Ramanathan, On the complexity of distance-2 coloring, in Proceedings of the 4th International Conference on Computing and Information (ICCI '92, Toronto), IEEE Computer Society Press, Piscataway, NJ, 1992, pp. 71-74.
13. S. T. McCormick, Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem, Math. Programming, 26 (1983), pp. 153-171.
14. R. Motwani and M. Sudan, Computing roots of graphs is hard, Discrete Appl. Math., 54 (1994), pp. 81-88.
15. C. St. J. A. Nash-Williams, Decomposition of finite graphs into forests, J. London Math. Soc., 39 (1964), p. 12.
16. S. Ramanathan and E. L. Lloyd, Scheduling algorithms for multihop radio networks, IEEE/ACM Trans. on Networking, 1 (1993), pp. 166-177.
17. A. Sen and M.L. Huson, A new model for scheduling packet radio networks, Wireless Networks, 3 (1997), pp. 71-82.
18. A. Sen and M. L. Malesinska, On Approximation Algorithms for Radio Network Scheduling, Technical Report 96-108, Department Computer Science and Engineering, Arizona State University, Tempe, AZ, 1996.
19. G. Wegner, Graphs with Given Diameter and a Coloring Problem, Technical report, University of Dortmund, Dortmund, Germany, 1977.
20. X. Zhou, Y. Kanari, and T. Nishizeki, Generalized vertex-colorings of partial k-trees, IEICE Trans. Fundamentals, E83-A (2000), pp. 671-678.