| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649474 | Discrete Mathematics | 2009 | 9 Pages |
Abstract
A generalization of the circular chromatic number to hypergraphs is discussed. In particular, it is indicated how the basic theory, and five equivalent formulations of the circular chromatic number of graphs, can be carried over to hypergraphs with essentially the same proofs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Richard C. Brewster, Gary MacGillivray, Laura Shepherd,