On an upper bound of a graph's chromatic number, depending on the graph's degree and density

O. V. Borodin, A. V. Kostochka

Research output: Contribution to journalArticlepeer-review

Fingerprint

Dive into the research topics of 'On an upper bound of a graph's chromatic number, depending on the graph's degree and density'. Together they form a unique fingerprint.

Mathematics