• Mathematics
  • Published 2003

The Strong Edge Chromatic Number of Regular Graphs with High Degree

@inproceedings{Zhen2003TheSE,
  title={The Strong Edge Chromatic Number of Regular Graphs with High Degree},
  author={Xu Zhen},
  year={2003}
}
For a graph G,f is a strong edge coloring if it is proper and any two vertices are incident with different sets of colors.The minimum number of colors necessary for a strong edge coloring of G is denoted′(G).We prove that ′(G)=n for a (n-2) regular graph of ordern,and ′(G)=n-1 for a (n-3) regular graph of order n6, for which complementary graph is a Hamilton cycle.We also show a sufficient condition of ′(G-e)′(G)+1 and a necessary condition of ′(G-e)=′(G)+2, where e is a edge of G.