A note on n-tuple colourings and circular colourings of planar graphs with large odd girth
International Journal of Computer Mathematics
Note: A connection between circular colorings and periodic schedules
Discrete Applied Mathematics
Paths, cycles and circular colorings in digraphs
Theoretical Computer Science
Resource-sharing systems and hypergraph colorings
Journal of Combinatorial Optimization
Gallai's Theorem for List Coloring of Digraphs
SIAM Journal on Discrete Mathematics
The distance spectral radius of digraphs
Discrete Applied Mathematics
Circular L(j,k)-labeling number of direct product of path and cycle
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
The notion of (circular) colorings of edge-weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs corresponds to the traveling salesman problem (metric case). It also gives rise to a new definition of the chromatic number of directed graphs. Several basic results about the circular chromatic number of edge-weighted graphs are derived. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 107–116, 2003