| 关于图的星荫度的一个注 |
| |
| 引用本文： | 董进全.关于图的星荫度的一个注[J].内蒙古大学学报(自然科学版),1992,23(4):465-467. |
| |
| 作者姓名： | 董进全 |
| |
| 作者单位： | 内蒙古大学数学系 |
| |
| 基金项目： | The work is supported by Nei Monggol Educational Science Foundation |
| |
| 摘 要： | 图G的曼荫度vas(G)定度为对G进行项点着色且使得G中同色顶点导出的子图的每个连通分支都为星时所需的最少色数,本文证明了平面图和外平面图的曼荫度的平凡上界事实上也是最好的上界.
|
| 关 键 词： | 图的着色 星荫度 外平面图 平面图 平图 |
On the Vertex Star Arboricity of A Graph |
| |
| Dong Jinquan.On the Vertex Star Arboricity of A Graph[J].Acta Scientiarum Naturalium Universitatis Neimongol,1992,23(4):465-467. |
| |
| Authors: | Dong Jinquan |
| |
| Institution: | Dong JinquanDepartment of Mathematics |
| |
| Abstract: | The vertex star arboricity vsa(G) of a graph G is defined as the minimum number of colors needed to color G such that each subgraph induced by the set of all vertices colored with same color has only stars as its components.In this note,It is proved that the trival upper bounds for vsa(G) of planar,outerplanar graphs are indeed best possible. |
| |
| Keywords: | coloing of a graph vertex star arboricty of a graph outerplanar graph planar graph plane graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
