The circular altitude of a graph
Combinatorics
2016-08-23 v1
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.
Keywords
Cite
@article{arxiv.1608.06127,
title = {The circular altitude of a graph},
author = {John Bamberg and Brian Corr and Alice Devillers and Daniel Hawtin and Irene Pivotto and Eric Swartz},
journal= {arXiv preprint arXiv:1608.06127},
year = {2016}
}