| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657410 | Journal of Combinatorial Theory, Series B | 2008 | 9 Pages |
Abstract
We prove that the chromatic number of an oriented matroid O of rank r⩾3 is at most r+1 with equality if and only if O is the oriented matroid of an orientation of Kr+1, the complete graph on r+1 vertices.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
