2400ff57-c573-444a-bc02-2f8ba8537b62 beie director@blueeyesintelligence.org 10.35940/ijitee.I9291.0710921 A. D. N. J. de Grey, "The chromatic number of the plane is at least 5," Geombinatorics, vol. 28, no. 1, 2018, pp. 1831.M. J. H. Henle, "Computing small unit-distance graphs with chromatic number 5," Geoombinatorics, vol. 28, no. 1, 2018, pp. 3250.10.1007/978-1-4614-0110-0_24M. Schafer, "Realizability of graphs and linkages in Thirty essays on geometric graph theory," J. Pach, ed., Springer, New York, 2013, pp. 461482.Aiden Globus, and Hans Parshal, "Small unit distance graphs in the plane," Bulletin of the ICA, vol. 90, 2020, pp. 107138.K. B. Chilakamarri, and C. R. Mahoney, "Maximal and minimal forbidden unit-distance graphs in the plane," Bull. Inst. Combin. Appl., vol. 13, 1995, pp. 35-43.Aidan Globus, and Hans Parshall, "Small unit-distance graphs in the plane," Bulletin of the Ica, vol. 90, 2020, pp. 107-138.M. Voigt, "On the chromatic number of distance graphs," J. Inform. Process. Cybernet. EIK, vol. 28, 1992, pp. 21-28.M. Voigt, "Die chromatische Zahl einer speziellen Klasse unendlicher Graphen," Dissertationsschrifl, Techn. Univ. Ilmenau, 1992.M. Voigt, "Ffirbung yon Distanzgraphen," preprint, 1993.10.1016/0166-218X(94)90109-0M. Voigt, and H. Walther, "Chromatic number of prime distance graphs," Discrete App. Math., vol. 51, 1994, pp. 197209.10.1016/0012-365X(91)90454-AM. Voigt, and H. Walther, "On the chromatic number of special distance graphs," Discrete Math., vol. 97, 1991, pp. 395-397.F. Kramer, and H. Kramer, "Un problem decoloration des sommets d'un graphe," C.R. Acad. Sci. Paris A, vol. 268, no. 7, 1969, pp. 4648.10.1016/j.disc.2006.11.059F. Kramer, and H. Kramer, "A survey on the distance-coloring of graphs," Discrete Math., vol. 308, 2008, pp. 422426.M. Kahle, "Chromatic number of the hyperplane," Math-overflow, 2012.Benoit Kloeckner, "Coloring distance graphs : a few answers and many questions," Geombinatorics, University of Colorado, USA, vol. XXIV, no. 3, 2015, pp. 117.10.1007/BF00181411K. B. Chilakamarri, "Unit-distance graphs in Minkowski metric spaces," Geom. Dedicata, vol. 37, no. 3, 1991, pp. 345356.10.1016/S1385-7258(51)50053-7P. Erdos, and N. G. de Bruijn, "A color problem for infinite graphs and a problem in the theory of relations," Indag. Math., vol. 13, 1951, pp. 371373.10.3390/sym10100468V. Yegnanarayanan, Y. Gayathri Narayana and Marius. E. Balas, "On Coloring Catalan Number Distance Graphs and Interference Graphs," Symmetry, vol. 10, no. 10, 2018, pp. 468; https://doi.org/10.3390/sym10100468 pp 1-13.V. Yegnanarayanan, R. Srikanth, and M. Shanthi, "A brief note on distance graphs," Asia Life Sciences Supplement, vol. 14, no. 1, 2017, pp. 205212.V. Yegnanarayanan, "Chromatic Number of Graphs with Special Distance Sets I," Algebra and Discrete Mathematics (ADM), vol. 17, no.1, 2014, pp 135160.10.4236/ojdm.2013.31001V. Yegnanarayanan, and A. Parthiban, "Chromatic Number of Graphs with Special Distance Sets V," Open Journal of Discrete Mathematics, vol. 3, issue 1, 2013, pp. 1-6. doi:10.4236/ojdm.2013.31001 Published online January 2013 (http://www.scirp.org/journal/ojdm) https://doi.org/10.4236/ojdm.2013.3100110.12732/ijpam.v86i4.7V. Yegnanarayanan, and A. Parthiban., "Vertex Coloring of Certain Distance Graphs," International Journal of Pure and Applied Mathematics, vol. 86, no. 4, 2013, pp. 669688, https://doi.org/10.12732/ijpam.v86i4.710.1016/S0012-365X(01)00221-7V. Yegnanarayanan, "On A Question Concerning Prime Distance Graphs," Discrete Mathematics, vol. 245, no.1-3, 2002, pp. 293298.V. Yegnanarayanan, "On Coloring Distance Graphs," Asia Mathematika, vol. 3, issue 1, April 2019, pp. 6069. Available online at www.asiamath.orgV. Yegnanarayanan, and A. Parthiban, "Chromatic Number of Graphs with Special Distance Sets III," J. Math. Comput. Sci., vol. 2, issue 5, 2012, pp. 12571268.V. Yegnanarayanan, "The chromatic number of generalized Fibonacci prime distance graph," J. Math. Comput. Sci., vol. 2, issue. 5, 2012, pp. 14511463.10.1109/SmartTechCon.2017.8358628V. Yegnanarayanan, "On Prime Distance Graphs and Applications," International Conference on Smart Technologies for Smart Nation (SmartTechCon 2017), to be held at the REVA University, Bangalore, Karnataka, India from 17-19 August 2017, Sponsored by IEEE, Bangalore Section.10.1109/SmartTechCon.2017.8358628978-1-5386-0569-I$31.00@2017 IEEE, Pp 1564-1568, 2017 DOI: 10.1109/SmartTechCon.2017.8358628 Date Added to IEEE Digital Explore 14th May 2018.V. Yegnanarayanan, "On Prime Distance Labelng and applications," International Conference on Smart Technologies for Smart Nation (SmartTechCon 2017), to be held at the REVA University, Bangalore, Karnataka, India from 17-19 August 2017. 978-1-5386-0569-I$31.00@2017 IEEE, Pp 1569-1575,2017 DOI: 10.1109/SmartTechCon.2017.8358628Date Added to IEEE Digital Explore 14th May 2018.V. Yegnanarayanan, and A. Parthiban, "On Unit Distance Graphs," Proc of Third International Conference on Discrete Mathematics (ICDM-2013), Karnatak University, Dharwad, June 10-14, 2013, Sponsored by Department of Science and Technology(DST), India and Visvesvaraya Technological University(VTU), Belgaum, India.V. Yegnanarayanan and A. Parthiban, "Chromatic Number of Graphs with Special Distance Sets IV," Proc of International Conference on Applied Mathematics and Theoretical Computer Science, ICAMTCS 2013, Jan 24-25, 2013, pp. 7176, ISBN 978-93- 82338-30-7 c ⃝2013 Bonfring, Sponsored by IEEE, Madras Section, DRDO, CSIR, DST, organized by St. Xavier's Catholic College of Engineering, Nagercoil, Kanyakumari, India.V. Yegnanarayanan, and A. Parthiban, "Chromatic Number of Certain Graphs," Proc of International Conference on Mathematics in Engineering and Business Management, Stella Maris College, Chennai, vol. I, March 9-11, 2012, pp. 115118. ISBN 978-81-8286- 015-5.V. Yegnanarayanan, and A. Parthiban, "Chromatic Number of Graphs with Special Distance Sets II", Proc of International Conference on Mathematical Modeling and Applied Soft Computing, CIT, Coimbatore, India, July, 11-13, 2012, pp. 308-3 ISBN No. 978-81- 923752-1-2.