Given any rational numbers r≥r2˘7>2 and an integer g, we
prove that there is a graph G of girth at least g, which is
uniquely r-colourable and uniquely r2˘7-fractional colourable
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.