| 有向图的无圈色数的上界 |
| |
| 引用本文： | 李乔,黄道德.有向图的无圈色数的上界[J].中国科学技术大学学报,1989,19(2):157-160. |
| |
| 作者姓名： | 李乔 黄道德 |
| |
| 作者单位： | 中国科学技术大学数学系
(李乔)，中国科学技术大学数学系(黄道德) |
| |
| 摘 要： | 有向图D的无圈色数定义为满足下述要求的D的顶点染色中的最小色数:同色顶点集在D中的导出子图不含有向圈。本文给出D的无圈色数的三种上界,它们改进了已知结果并可以认为是无向图的色数上界在有向图情形的推广。
|
| 关 键 词： | 有向图 无圈色数 上界 |
On the Upper Bounds for the Acyclic Dichromatic Number of a Digraph |
| |
| Li Qiao,Huang Daode Dept. of Mathematics.On the Upper Bounds for the Acyclic Dichromatic Number of a Digraph[J].Journal of University of Science and Technology of China,1989,19(2):157-160. |
| |
| Authors: | Li Qiao Huang Daode Dept of Mathematics |
| |
| Institution: | Li Qiao;Huang Daode Dept. of Mathematics |
| |
| Abstract: | The acyclic dichromatic number of a digraph D is defined as the minimumnumber of colors required to color the vertices of D in such a way thatevery color class induces an acyclic subdigraph in D. In this paper we provethree upper bounds for acyclic dichromatic number which improve knownresults and might be regarded as the digraph version of three well knownextentions of Brooks' theorem for graphs. |
| |
| Keywords: | digraph acyclic dichromatic number upper bound |
| 本文献已被 CNKI 维普 等数据库收录！ |
