А. М. Райгородский, Mikhail Koshelev
Abstract
Abstract We significantly improve lower bounds on the clique-chromatic numbers for some families of Johnson graphs. A new upper bound on the clique-chromatic numbers for G(n, r, r – 1) and G(n, 3, 1) is obtained. Finally, the exact value of the clique-chromatic number for G(n, 2, 1) is provided.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract We significantly improve lower bounds on the clique-chromatic numbers for some families of Johnson graphs. A new upper bound on the clique-chromatic numbers for G(n, r, r – 1) and G(n, 3, 1) is obtained. Finally, the exact value of the clique-chromatic number for G(n, 2, 1) is provided.
Key concepts: Mathematics, Chromatic scale, Combinatorics, Clique number, Clique, Upper and lower bounds, Discrete mathematics, Clique-sum