Author:
Manikandan K.,Harikrishnan T.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference14 articles.
1. Brooks, R.L.: On colouring the nodes of a network. Proc. Camb. Philos. Soc. 37, 194–197 (1941)
2. Chen, B.L., Ko, M.T., Lih, K.W.: Equitable and m-bounded coloring of split graphs. Lect. Notes Comput. Sci. 1120, 1–5 (1996)
3. Chen, B.L., Lih, K.W., Wu, P.L.: Equitable coloring and the maximum degree. Eur. J. Comb. 15, 443–447 (1994)
4. Das, S.K., Finocchi, I., Petreschi, R.: Conflict-free star-access in parallel memory systems. J. Parallel Distrib. Comput. 66, 1431–1441 (2006)
5. Furmanczyk, H., Kubale, M.: Equitable Coloring of Graphs. Graph Colorings, pp. 35–53. American Mathematical Society, Providence (2004)