PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

A note on n-tuple colourings and circular colourings of planar graphs with large odd girth
Petra Šparl and Janez Žerovnik
International journal of computer Volume 84, Number 12, pp. 1743-1746, 2007. ISSN 0020-7160

Abstract

The existance of planar graphs with odd girth 2k + 1 and high girth that cannot be (2k + 1, k)-coloured was left as an open question by Klostermeyer and Zang. In this note we show that such graphs exist for arbitraryly large k. We also show that these graphs have fractional chromatic number greater than 2 + 1/k.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:3727
Deposited By:Igor Pesek
Deposited On:15 February 2008