A lower bound on the chromatic number of a graph

DOI10.1002/net.3230010306zbMath0233.05105OpenAlexW2043144260MaRDI QIDQ5641166

No author found.

Publication date: 1972

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230010306

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item, New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix, Lower bounds for the clique and the chromatic numbers of a graph