A note on the vertex-distinguishing proper edge coloring of graphs

CORC > 北京大学 > 信息科学技术学院

	A note on the vertex-distinguishing proper edge coloring of graphs
	Zhu, Enqiang ; Liu, Chanjuan
刊名	ars combinatoria
	2014
关键词	vertex-distinguishing edge coloring vertex-distinguishing edge chromatic number subgraph cycle fan OBSERVABILITY
英文摘要	The number of colors, required to color properly the edges of a simple graph G in such a way that any two vertices are incident with different sets of colors, is referred to as vertex-distinguishing edge chromatic, denoted by chi(vd)'(G). An interesting phenomenon on vertex-distinguishing proper edge coloring is concerned in this paper. We prove that for every integer m >= 3, there is always a graph G of maximum degree m with chi(vd)' (G) < chi(vd)'(H), where H is a proper subgraph of G.; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000337715500007&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701 ; Mathematics; SCI(E); 0; ARTICLE; zhuenqiang@163.com; 93-99; 116
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/389079]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Zhu, Enqiang,Liu, Chanjuan. A note on the vertex-distinguishing proper edge coloring of graphs[J]. ars combinatoria,2014.
APA	Zhu, Enqiang,&Liu, Chanjuan.(2014).A note on the vertex-distinguishing proper edge coloring of graphs.ars combinatoria.
MLA	Zhu, Enqiang,et al."A note on the vertex-distinguishing proper edge coloring of graphs".ars combinatoria (2014).