Circular colorings of edge‐weighted graphs
Author:
- 18 April 2003
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 43 (2) , 107-116
Abstract
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, 2003Keywords
This publication has 5 references indexed in Scilit:
- Circular chromatic numberDiscrete Mathematics, 2001
- On (k,d)-colorings and fractional nowhere-zero flowsJournal of Graph Theory, 1998
- Circular colorings of weighted graphsJournal of Graph Theory, 1996
- A Theorem on n-Coloring the Points of a Linear GraphThe American Mathematical Monthly, 1962
- Some recent applications of the theory of linear inequalities to extremal combinatorial analysis1960