|
|||||
|
|
| 两类图的边色数 | |
| 引用本文： | 孙良 徐军. 两类图的边色数[J]. 北京理工大学学报, 1992, 12(4): 1-4 |
| 作者姓名： | 孙良 徐军 |
| 作者单位： | 北京理工大学应用数学系(孙良)，北京理工大学应用数学系(徐军) |
| 摘 要： | 设G是连通循环图.本文讨论两个与循环图有关的图类的边着色问题,得到了下列结论:①如G是奇素数幂阶循环图,则对G的任意点v,G-v是第一类的;②如G是奇数阶循环图,则G的线图L(G)是1-可因子化的,当且仅当G的边数为偶数。 |
| 关 键 词： | 循环图 线图 图论 边色数 |
Edge Chromatic Numbers of Two Classes of Graphs |
|
| Sun Liang Xu Jun. Edge Chromatic Numbers of Two Classes of Graphs[J]. Journal of Beijing Institute of Technology(Natural Science Edition), 1992, 12(4): 1-4 | |
| Authors: | Sun Liang Xu Jun |
| Abstract: | Discusses the edge coloring of two classes of graphs related to rirculant graphs. The following conclusions are obtained. (1) If G is a connected circulant graph with an odd prime power as its order, then G - v is Class 1 for any vertex v of G. (2) If G is a connected circulant graph of odd order, then the line graph L(G) of G is 1 -factorable if and only if the edge number of G is even. |
| Keywords: | criticality/circulant graph line graph edge coloring |
| 本文献已被 CNKI 维普 等数据库收录！ | |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 | |
| 点击此处可从《北京理工大学学报》下载全文 | |