G-2010-74
A Survey of Nordhaus-Gaddum Type Relations
and
BibTeX referenceIn 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.
Published December 2010 , 108 pages
This cahier was revised in December 2011
Research Axis
Research applications
Publication
Jan 2013
A survey of Nordhaus-Gaddum type relations
and
Discrete Applied Mathematics, 161(4-5), 466–546, 2013
BibTeX reference