Abstract
In this paper we investigate a parameter of graphs, called the circular altitude, introduced by Peter Cameron. We show that the circular altitude provides a lower bound on the circular chromatic number, and hence on the chromatic number, of a graph and investigate this parameter for the iterated Mycielskian of certain graphs.
Original language | English |
---|---|
Pages (from-to) | 357–368 |
Journal | Australasian Journal of Combinatics |
Volume | 72 |
Issue number | 2 |
Publication status | Published - 2018 |