Circular chromatic number of triangle-free hexagonal graphs /
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.
Shranjeno v:
| Main Authors: | , |
|---|---|
| Format: | Book Chapter |
| Jezik: | English |
| Teme: | |
| Sorodne knjige/članki: | Vsebovano v:
International journal of pure and applied mathematics |
| Oznake: |
Označite
Brez oznak, prvi označite!
|
Vzdrževanje sistema
Trenutno vzdržujemo knjižnični informacijski sistem.
Informacije o zalogi so trenutno nedostopne. Opravičujemo se za nevšečnosti in vas prosimo da nas ponovno kontaktirate: