图的点强全染色  

Problems on vertex strong total coloring of graphs

作　　者：朱海洋[1] 郝建修[1] 

机构地区：[1]浙江师范大学数理学院,浙江金华321004

出　　处：《河南科学》2005年第5期642-646,共5页Henan Science

基　　金：浙江省自然科学基金资助(102055)

摘　　要：图G(V,E)的正常k—全染色f叫做G(V,E)的k—点强全染色,当且仅当对任意的w∈V(G),N[w]中元素染不同颜色,其中N[w]={x|wx∈E(G)}∪{w}.并称XvTs(G)=min{k|存在G的k—点强全染色}为图G(V,E)的点强全色数.本文研究了K4-minor free图和外平面图的点强全色数.A proper total k-coloring of graph G （ V, E ） is called a k-vertex strong total coloring of G （ V, E ）, iff for any w ∈ V（G）, the elements in N [ w ] are colored with different colors, where N [ w ] = ｜ x ｜ wx ∈ E （G） ｜ U ｜ w ｜. XT^vs （ G ） = min ｜ k ｜ there is a k-vertex strong total coloring of G｜ is called the vertex strong total chromatic number of G. In this paper, the vertex strong total chromatic of K4-minor free graph and outerplanar graph are studied.

关 键 词：K4-minor FREE图 外平面图 平方图 点强全色数 色数 

分 类 号：O157.5[理学—数学]