|
This article is available for purchase or by subscription. See below.
Abstract
|
|
We introduce new lower bounds on the clique-chromatic numbers of
and
graphs. We also prove the clique-chromatic number of
to be a bounded
function of
for
each fixed .
|
PDF Access Denied
We have not been able to recognize your IP address
3.140.186.241
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
clique-chromatic numbers, Johnson graphs, finite projective
plane
|
Mathematical Subject Classification
Primary: 05C15
|
Milestones
Received: 4 October 2020
Revised: 6 January 2021
Accepted: 21 January 2021
Published: 23 June 2021
|
|
