| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651076 | Discrete Mathematics | 2007 | 8 Pages |
Abstract
In this paper we consider the circular edge coloring of four families of Class 2 graphs. For the first two we establish the exact value of the circular chromatic index. For the next two, namely Goldberg and Isaacs snarks we derive an upper bound on this graph invariant. Finally, we consider the computational complexity of some problems related to circular edge coloring.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Adam Nadolski,