Coloring in a graph refers either to vertex coloring, edge coloring or both in which case it is called total coloring. Each vertex is assigned a color from a set of colors such that no two adjacent vertices have the same color in vertex coloring. Edge coloring is the process of assigning colors to the edges of a graph such that no two edges incident to the same vertex are assigned the same color. We review sequential, parallel, and distributed algorithms for vertex and edge coloring in this chapter.
- 1.Allwright JR, Bordawekar R, Coddington PD, Dincer K, Martin CL (1995) A comparison of parallel graph coloring algorithms. Technical report SCCS-666, Northeast Parallel Architecture Center, Syracuse UniversityGoogle Scholar
- 2.Barenboim L, Elkin M (2013) Distributed graph coloring. Monograph, Ben Gurion University of the NegevGoogle Scholar
- 7.Gandham S, Dawande M, Prakash R (2005) Link scheduling in sensor networks: distributed edge coloring revisited. In: Proceedings of the 24th INFOCOM, vol 4, pp 2492–2501Google Scholar
- 9.Gebremedhin AH (1999) Parallel graph coloring. MS thesis, Department of Informatics University of Bergen NorwayGoogle Scholar
- 12.Halldorsson MM (1991) Frugal methods for the independent set and graph coloring problems. Ph.D. thesis, The State University of New Jersey, New Brunswick, New Jersey, October 1991Google Scholar
- 18.Nishizeki T, Terada O, Leven D (1983) Algorithms for edge-coloring of graphs. Tohoku University, Electrical Communications Department, Technical report, TRECIS 83001Google Scholar