经济数学2000，Vol.17Issue(2)：42-44,3.
Petersen图的Hamilton性和边色数
ON THE HAMILTON-PROPERTY AND EDGE CHROMATIC NUMBER OF INCIDENCE CRAPH OF PETERSEN GRAPH
摘要
Abstract
For a graph G( V, E), we define the incidence graph I(G) of G is such a graph which V(I(G)) ={(ve)|v ∈ V(G) ande ∈ E(G) and v incident toe}, E(I(G) ) = {(ue, vf)|u = vore = f or uv = e or uv = f}. In this paper, we proved that the incidence graph of Petersen graph can be classified into a union of edge-disjoint Hamilton cycles and one 1-factor.关键词
Petersen图/关联图/Hamilton-性/边色数Key words
Petersen graph/incidence graph/Hamilton-properties/edge coloring chromatic分类
管理科学引用本文复制引用
张忠辅,李敬文,刘林忠,王建方..Petersen图的Hamilton性和边色数[J].经济数学,2000,17(2):42-44,3.基金项目
This Research are supported by NNSFC(No.19871036) （No.19871036）
