| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428914 | Information Processing Letters | 2006 | 6 Pages |
Abstract
An oriented k-coloring of an oriented graph G is a mapping such that (i) if xy∈E(G) then c(x)≠c(y) and (ii) if xy,zt∈E(G) then c(x)=c(t)⇒c(y)≠c(z). The oriented chromatic number of an oriented graph G is defined as the smallest k such that G admits an oriented k-coloring. We prove in this paper that every Halin graph has oriented chromatic number at most 9, improving a previous bound proposed by Vignal.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
