系列平行图的边色数

The Edge Chromatic Number of SP Graphs

Vizing( 1 96 4年 )和Gupta( 1 96 6年 )各自独立地证明了边着色中的重要定理 :对任何简单图G ,有χ′(G) =Δ或 χ′(G) =Δ + 1。但确定一个图G的边色数仍是一个尚未解决的问题。本文利用系列平行图的结构性质 。

Vizing (in 1964) and Gupta(in 1966)proved the important theorem in the edge coloring independently:for any simple graph G,χ′(G)=Δ or χ′(G)=Δ+1 .But determination of the edge chromatic number of graph G is still a unsolved problem.In this paper,we will determine the edge chromatic number of SP graphs using the configuration property of SP graphs.