Lower bounds for the clique and the chromatic numbers of a graph


G is any simple graph with m edges and n veriices where these vertices have vertex degrees d(l)zd(2)r...rd(n), respectively. General algorithms for the exact calculation of x(G), the chromatic number of G, are almost always of ‘branch and bound’ type; this type of algorithm requires an easily constructed lower bound for x(G). In this paper it is shown that… (More)
DOI: 10.1016/0166-218X(83)90015-X

1 Figure or Table


  • Presentations referencing similar topics