Uniquely circular colourable and uniquely fractional colourable graphs of large girth

Abstract

Given any rational numbers rr2˘7>2r \geq r\u27 >2 and an integer gg, we prove that there is a graph GG of girth at least gg, which is uniquely rr-colourable and uniquely r2˘7r\u27-fractional colourable

Similar works

Full text

Contributions to Discrete Mathematics (E-Journal, University of Calgary)

redirect
Last time updated on 15/12/2019

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.