具有唯一4度最大度点图全色数(英文).pdf

Journal of M athem atical R esearch Expo sition . 18, . 1, 3338, 1998 V o l N o February The Total Chromatic Num ber of Graphs with an Un ique M ajor Vertex of D egree Four X u B aog ang (D ep t. of M ath. , Shandong U niversity, J inan 250100) Abstract　T he to tal ch rom atic num ber T (G ) of a graph G is the least num ber k such that G adm its a to k . , (G) = (G) + 1 tal co lo ring w ith co lo rs In th is paper it is p roved that T fo r all graph s w ith an u nique m ajo r vertex of degree 4. Keywords　 graph , to tal co lo ring, m ajo r vertex. 　 ( 1991) 05 15 157. 5 Classif ication AM S C CCL O 1. In troduction . A ll graph s in th is paper are fin ite and sim p le U ndefined sign s and concep ts can be found in [1 ]. Given a graph G , N G (v ) , d G (v ) and (G) deno te the neighbou r set of a vertex v in G , the degree of v in G and the m ax im um degree of vertices of G , respectively. Fo r any tw o elem en ts u and v in V (G) ∪E (G ) , w e say that u and v cover each o ther if u and v are adjacen t o r inciden t, u v . S V (G) ∪E (G ) and say that and are independen t to each o ther o therw ise A sub set of is called G S