|
Circular chromatic number of triangle-free hexagonal graphs
Janez Žerovnik and Petra Šparl
International journal of pure and applied
Volume 44,
Number 2,
,
2008.
ISSN Y504-7919
Abstract An 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.
| EPrint Type: | Article |
|---|
| Project Keyword: | Project Keyword UNSPECIFIED |
|---|
| Subjects: | Theory & Algorithms |
|---|
| ID Code: | 4617 |
|---|
| Deposited By: | Igor Pesek |
|---|
| Deposited On: | 13 March 2009 |
|---|
[Edit]
| 