The Sum and Product of Chromatic Numbers of Graphs and their Line Graphs
C. Susanth & Sunny Joseph Kalayathankal · Journal of Advances in Mathematics and Computer Science · 2015
The bounds on the sum and product of chromatic numbers of a graph and its complement are known as Nordhaus-Gaddum inequalities. In this paper, some variations on this result is studies. First, recall their theorem, which gives bounds on the sum and the product of the chromatic nu...
Open access
Research Article
10.9734/BJMCS/2016/20823