The Proof of Formula for Chromatic Number in the Quasi-Strong Edge Colourings of Graphs
Lian Guang-chang · Journal of Jinling Institute of Technology · 2005
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)≤χ′___(QS)(G)≤Δ(G)+2 when Δ(G)≥2.