Circular chromatic number of triangle-free hexagonal graphs
## AbstractAn interesting connection between graph homomorphisms to odd cycles and circular chromatic number is presented. By using this connection, bounds for circular chromatic number of triangle-free hexagonal graphs (i.e. induced subgraphs of triangular lattice) are given.
[Edit] |