Uniquely circular colourable and uniquely fractional colourable graphs of large girth

Authors

  • Xuding Zhu
  • Shuyuan Lin

DOI:

https://doi.org/10.11575/cdm.v1i1.61914

Abstract

Given any rational numbers $r \geq r' >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 $r'$-fractional colourable.

Downloads

Published

2006-03-24

Issue

Section

Articles