Hits :

First Author : Chen Min

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2006-01-01

Document Type : 期刊

Journal : Information Processing Letters

Volume: Vol.99

Issue : NO.2

Page Number : 47-53

ISSN : 0020-0190

Translation or Not : no

Key Words : Combinatorial;problems;Oriented;coloring;Halin;graph

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 smal