Albertson's Conjecture on Crossing Numbers
Journal: International Journal of Science and Research (IJSR) (Vol.4, No. 5)Publication Date: 2015-05-05
Authors : Tessy Cardoz; Renukadevi.V; Malarvizhi.P;
Page : 1091-1094
Keywords : Crossing number; complete graph; critical graph; lower bound;
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.
Other Latest Articles
- AgNPs Synthesis, Characterization and Antibacterial Activity from Salvia splendens Sellow ex Roem. &Schult. Plant Extract
- Development and Validation of the RP-HPLC Method for the Analysis of Chloropyrifos
- Anatomical Variants of Circle of Willisin South Indian Population: A Study by Using Magnetic Resonance Angiography
- Denoising of Images Corrupted By Mixed Noise Using Improved WESNR Method
- Power Flow Analysis of Long Transmission Line Using SVC, SSSC and UPFC Integrated with Wind Power
Last modified: 2021-06-30 21:46:31