| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428365 | Information Processing Letters | 2006 | 7 Pages |
Abstract
A 2-dipath k-coloring f of an oriented graph is a mapping from to the color set {1,2,…,k} such that f(x)≠f(y) whenever two vertices x and y are linked by a directed path of length 1 or 2. The 2-dipath chromatic number of is the smallest k such that has a 2-dipath k-coloring. In this paper we prove that if is an oriented Halin graph, then . There exist infinitely many oriented Halin graphs such that .
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
