G-2010-74
A Survey of Nordhaus-Gaddum Type Relations
et référence BibTeX
In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the order of the graph. Since then, relations of a similar type have been proposed for many other graph invariants, in several hundred papers. We present a survey on this research endeavor.
Paru en décembre 2010 , 108 pages
Ce cahier a été révisé en décembre 2011
Axe de recherche
Applications de recherche
Publication
jan. 2013
A survey of Nordhaus-Gaddum type relations
et
Discrete Applied Mathematics, 161(4-5), 466–546, 2013
référence BibTeX