Adjacent vertex-distinguishing edge colorings of K-4-minor free graphs

doi:10.1016/j.aml.2011.05.038

CSpace

	Adjacent vertex-distinguishing edge colorings of K-4-minor free graphs
	Wang, Weifan 1; Wang, Yiqiao 2
	2011-12-01
发表期刊	APPLIED MATHEMATICS LETTERS
ISSN	0893-9659
卷号	24 期号:12 页码:2034-2037
摘要	The adjacent vertex-distinguishing chromatic index chi(a)'(G) of a graph G is the smallest integer k for which G admits a proper edge k-coloring such that any pair of adjacent vertices are incident to distinct sets of colors. In this paper, we prove that if G is a K-4-minor free graph, without isolated edges, and with maximum degree Delta >= 4, then Delta <= chi(a)'(G) <= Delta + 1; when Delta >= 5, chi(a)'(G) = Delta if and only if G contains no adjacent vertices of maximum degree. (C) 2011 Elsevier Ltd. All rights reserved.
关键词	K-4-minor free graph Adjacent vertex-distinguishing edge coloring Maximum degree
DOI	10.1016/j.aml.2011.05.038
语种	英语
资助项目	NSFC[11071223] ; ZJNSF[Z6090150] ; ZJNSF[Z6110786] ; ZJIP[T200905] ; [ZSDZZZZXK08]
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:000294886000013
出版者	PERGAMON-ELSEVIER SCIENCE LTD
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/12178
专题	中国科学院数学与系统科学研究院
通讯作者	Wang, Weifan
作者单位	1.Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China 2.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Wang, Weifan,Wang, Yiqiao. Adjacent vertex-distinguishing edge colorings of K-4-minor free graphs[J]. APPLIED MATHEMATICS LETTERS,2011,24(12):2034-2037.
APA	Wang, Weifan,&Wang, Yiqiao.(2011).Adjacent vertex-distinguishing edge colorings of K-4-minor free graphs.APPLIED MATHEMATICS LETTERS,24(12),2034-2037.
MLA	Wang, Weifan,et al."Adjacent vertex-distinguishing edge colorings of K-4-minor free graphs".APPLIED MATHEMATICS LETTERS 24.12(2011):2034-2037.