Abstract

The circular chromatic number, introduced in 1980 by Vince, provides a more refined measure of colourability of graphs, than does the ordinary chromatic number. Thus circular colouring is of substantial importance wherever graph colouring is studied or applied. We present results regarding circular edge colourings of cubic graphs. These include the circular chromatic indices of several infinite families of snarks, namely Isaacs' flower snarks, Goldberg snarks, and generalized Blanu\v{s}a snarks.

You may see the slides of his talk here.



Information: