New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph

From MaRDI portal
Publication:896848