摘要
本文给出了θ－图的卢、面、边面金色数和点边面完备色数。
If graph G is composed of three different paths from vertex u to v and at most one of the lengthes of the paths is 1, we define G to be a θ-graph. This paper has studied vertex-face total chromatic number, edge-face total chromatic number and vertexedgeface complete chromatic number of θ-graph.
出处
《兰州铁道学院学报》
1994年第4期125-127,共3页
Journal of Lanzhou Railway University
基金
甘肃省自然科学基金
关键词
Θ-图
点面全色数
面全色数
B-graph
vertex-total chromatic number
edge-face total chromatic number
vertex-edge-face complete chromatic number
