The circular altitude of a graph

John Bamberg, Alice Devillers, Irene Pivotto, Brian Corr, Daniel Hawtin, Eric Swartz

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)357–368
JournalAustralasian Journal of Combinatics
Volume72
Issue number2
Publication statusPublished - 2018

Fingerprint Dive into the research topics of 'The circular altitude of a graph'. Together they form a unique fingerprint.

  • Cite this