SHANDONG SCIENCE ›› 2018, Vol. 31 ›› Issue (6): 100-102.doi: 10.3976/j.issn.1002-4026.2018.06.016
• Other Research Article • Previous Articles
ZHANG Xiang-bo
Received:
Online:
Published:
Abstract:
The conjecture of vertex coloring was proposed in this paper:χ(G)≤S+C, where χ(G) is the vertex coloring number of agraph and S is vertex number of maximum clique;C is a constant and C∈Z+. If C=1,p is vertex number of G, we prove that for some graphs of S=p-6, χ(G)≤p-5.
Key words: maximum degree, vertex coloring, the maximum clique
CLC Number:
ZHANG Xiang-bo. A conjecture about vertex coloring[J].SHANDONG SCIENCE, 2018, 31(6): 100-102.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.sdkx.net/EN/10.3976/j.issn.1002-4026.2018.06.016
https://www.sdkx.net/EN/Y2018/V31/I6/100
Cited
