Circular Chromatic Number of Flower Graphs

Gao, Guo-Gane; Hahn, Gena; Zuou, HulsHan

Abstract

References

Journal of Combinatorial Mathematics and Combinatorial Computing

Volume 047
Pages: 117-127

Research article

Circular Chromatic Number of Flower Graphs

^¹, ^², ^³

¹Département d’informatique et de recherche opérationnelle Université de Montréal 2900 Boulevard Edouard-Montpetit Montréal, Québec, Canada H3C 3J7

²Département d’informatique et de recherche opérationnelle Université de Montréal 2900 Boulevard Edouard-Montpetit Montréal, Québec, Canada

³BellSouth Applied Technology, 5515 Spalding Drive, Norcors, GA30092 USA.

Published: 30/11/2003

Download PDF
Cite

Copyright Link
License

Abstract

Vince asked whether for each rational $r$ between 2 and 4 there was a planar graph of circular chromatic number $r$ . Moser and Zhu showed that the answer is yes, the first for $2 < r < 3$ , the second for $3 < r < 4$ . This paper gives another family of planar graphs with circular chromatic number between 2 and 3.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

Circular Chromatic Number of Flower Graphs

Abstract

Information

Guidelines

CP Initiatives

Follow CP