图的准强边着色色数公式的证明

The Proof of Formula for Chromatic Number in the Quasi-Strong Edge Colourings of Graphs

如果图G有一个合理边上色,使图G的所有相邻顶点的关联边上色集合都互不相同,则称图G为准强边着色。本文证明了:Δ(G)≥2时,图G的准强边着色色数满足Δ(G)≤χ′QS(G)≤Δ(G)+2。

If the graph G had a proper edge colourings and the colouring sets of incident edges at all adjacent vertices of graph G are different from each other, the graph G is said to be a quasi-strong edge colourings. This paper proves that the quasi-strong edge chromatic number of graph G has satisfied △ （G） ≤x′QS （ G ） ≤△ （ G ） ＋ 2 when △ （ G ）≥2.