Author:
Marappan Raja,Sethumadhavan Gopalakrishnan
Publisher
Springer Science and Business Media LLC
Reference45 articles.
1. Balakrishnan, R.; Ranganathan, K.: A Textbook of Graph Theory, 1st edn. Springer, New York (2000)
2. Garey, M.R.; Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
3. Maitra, T.; Pal, A.J.; Bhattacharyya, D.; Kim, T.: Noise reduction in VLSI circuits using modified GA based graph coloring. Int. J. Control Autom. 3(2), 37–44 (2010)
4. Yoshino, J.; Ohtomo, I.: Study on efficient channel assignment method using the genetic algorithm for mobile communication systems. Soft Comput. 9(2), 143–148 (2005)
5. Chen, X.; Zu, Y.; Xu, J.; Wang, Z.; Yao, B.: Vertex-distinguishing E-total colorings of graphs. Arab. J. Sci. Eng. 36(8), 1485–1500 (2011)
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献