Name
Abstract | ||
|---|---|---|
We introduce the circular chromatic number χc of a digraph and establish various basic results. They show that the coloring theory for digraphs is similar to the coloring theory for undirected graphs when independent sets of vertices are replaced by acyclic sets. Since the directed k-cycle has circular chromatic number k-(k – 1), for k ≥ 2, values of χc between 1 and 2 are possible. We show that in fact, χc takes on all rational values greater than 1. Furthermore, there exist digraphs of arbitrarily large digirth and circular chromatic number. It is NP-complete to decide if a given digraph has χc at most 2. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 227–240, 2004 |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1002/jgt.v46:3 | Journal of Graph Theory |
Keywords | Field | DocType |
digraph,np completeness,independent set | Graph theory,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Chromatic scale,Digraph,Arbitrarily large,Critical graph,Mathematics | Journal |
Volume | Issue | Citations |
46 | 3 | 30 |
PageRank | References | Authors |
2.10 | 4 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Drago Bokal | 1 | 135 | 14.98 |
| Gasper Fijavz | 2 | 88 | 7.66 |
| Martin Juvan | 3 | 195 | 24.72 |
| P. Mark Kayll | 4 | 65 | 8.34 |
| Bojan Mohar | 5 | 1523 | 192.05 |