| 平面图为第一类图的一个充分条件 |
| |
| 引用本文： | 李晓东.平面图为第一类图的一个充分条件[J].科技通报,2012(1):15-19. |
| |
| 作者姓名： | 李晓东 |
| |
| 作者单位： | 浙江财经学院数学与统计学院 |
| |
| 摘 要： | 边色数为最大度的图是第一类图。如果G是一个最大度为6的平面图,且对于每一个顶点v,存在一个整数kv∈{3,4,5},使得v∈kv-C,那么G是第一类图,这里,符号v∈kv-C表示v不在一个kv-圈上。
|
| 关 键 词： | 图论 平面图 边色数 |
A Sufficient Condition for Planar Graph to be Class One |
| |
| LI Xiaodong.A Sufficient Condition for Planar Graph to be Class One[J].Bulletin of Science and Technology,2012(1):15-19. |
| |
| Authors: | LI Xiaodong |
| |
| Institution: | LI Xiaodong(Institute of Mathematics and Statistics,Zhejiang University of Finance and Economics,Hangzhou 310018,China) |
| |
| Abstract: | The graph is of Class one if chromatic index is the maximum degree.It is proved that if G is a planar graph with maximum degree 6,and for each vertex v,there is an integer kv∈{3,4,5} such that vkv-C,then G is class one,where vkv-C denotes that v does not on a kv-cycle of G. |
| |
| Keywords: | graph theory planar graph edge colouring |
| 本文献已被 CNKI 等数据库收录！ |
|
