Item #29135 BROOK'S THEORUM: "On Colouring the Nodes of a Network" (Proceedings of the Cambridge Philosophical Society 37 pp. 194-197). R. Leonard Brooks.

BROOK'S THEORUM: "On Colouring the Nodes of a Network" (Proceedings of the Cambridge Philosophical Society 37 pp. 194-197).

London: Cambridge University Press, 1941. Hardcover. First Edition. vii, [1]-445 pp. 4to. Black cloth with gold embossed titling to spine. Clean, crisp copy. Ex-library and barely noticeable. Fine.
In graph theory, R. Leonard Brooks' (1916-1993) theorem states a relationship between the maximum degree of a graph and its chromatic number. According to the theorem, in a connected graph in which every vertex has at most neighbors, the vertices can be colored with only colors, except for two cases, complete graphs and cycle graphs of odd length, which require + 1 colors. (Wikipedia).
[Book #29135]

Price: $750.00

See all items in Science & Technology
See all items by