摘要
对3连通图Halin 图,确定了其圈色数。
A coloring of the vertices if a plane graph is k -cyclic of whenever two vertices lie in the boundary of the same face of the size at most k,their colors are different.We denote by the k -cyclic chromatic number of a graph G,i.e.the minimum number of colors needed to color G k -cyclically.This paper gives the conclusion of of Halin graphs.
出处
《山东大学学报（自然科学版）》
CSCD
1999年第4期398-403,共6页
Journal of Shandong University(Natural Science Edition)
