QQ客服 官方微博 反馈留言

	Halin-图的点强全染色(英文)
	刘林忠 ; 李引珍 ; 张忠辅 ; LIU Lin-zhong ; LI Yin-zhen ; ZHANG Zhong-fu
	2010-06-07 ; 2010-06-07
关键词	Halin-图 图染色 点强全染色 全染色 Halin-graph coloring problem vertex strong total coloring total coloring problem. O157.5
其他题名	On the Vertex Strong Total Coloring of Halin-Graphs
中文摘要	图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}．χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数．对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图．本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G)+2,其中△(G)为图G(V,E)的最大度．; A proper k-total coloring / of the graph G(V, E) is said to be a fc-vertex strong total coloring if and only if for every v∈V(G), the elements in N[v] are colored with different colors, where N[v]={u|uv∈V(G)}∪{v}. The value χTvs(G) = min{k| there is a fc-vertex strong total coloring of G} is called the vertex strong total chromatic number of G. For a 3-connected plane graph G(V, E), if the graph obtained from G(V, E) by deleting all the edges on the boundary of a face fo is a tree, then G(V, E) is called a Halin-graph. In this paper, χTvs(G) of the Halin-graph G(V,E) with △(G) ≥ 6 and some special graphs are obtained. Furthermore, a conjecture is initialized as follows: Let G(V, E) be a graph with the order of each component are at least 6, then χTvs(G) ≤ △(G) + 2, where △(G) is the maximum degree of G.; the National Natural Science Foundation of China (No.19871036) the Qinglan talent Funds of Lanzhou Jiaotong University
语种	英语 ; 英语
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/40720]
专题	清华大学
推荐引用方式 GB/T 7714	刘林忠,李引珍,张忠辅,等. Halin-图的点强全染色(英文)[J],2010, 2010.
APA	刘林忠,李引珍,张忠辅,LIU Lin-zhong,LI Yin-zhen,&ZHANG Zhong-fu.(2010).Halin-图的点强全染色(英文)..
MLA	刘林忠,et al."Halin-图的点强全染色(英文)".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。