Petersen图的Hamilton性和边色数(英文)

ON THE HAMILTON PROPERTY AND EDGE CHROMATIC NUMBER OF INCIDENCE GRAPH OF PETERSEN GRAPH

对简单图G(V ,E) ,定义图G的关联图I(G)为V(I(G) ) ={ (ve)｜v∈V(G) 且e∈E(G) 和v与e关联 } ,E(I(G) ) ={ (ue ,vf)｜u=v或e=f或uv =e或uv=f} .本文证明了Petersen图可被分解为边不交的Hamilton 圈和一个 1

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) and e∈E(G) and v incident to e}, E(I(G))={(ue, vf)｜u=v or e=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.