Albertson's Conjecture on Crossing Numbers
Abstract: In this paper, we prove the Albertson-s Conjecture which states that -If graph G has chromatic number r, then the crossing number of G is atleast that of the Kr- for 7 - r - 10 using results of Dirac, Gallai and Kostochka Stiebitz and Pach et al.
Keywords: Crossing number, complete graph, critical graph, lower bound
How to Cite?: Tessy Cardoz, Renukadevi.V, Malarvizhi.P, "Albertson's Conjecture on Crossing Numbers", Volume 4 Issue 5, May 2015, International Journal of Science and Research (IJSR), Pages: 1091-1094, https://www.ijsr.net/getabstract.php?paperid=SUB154344, DOI: https://dx.doi.org/10.21275/SUB154344