中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Adjacent vertex-distinguishing edge colorings of K-4-minor free graphs

文献类型:期刊论文

作者Wang, Weifan1; Wang, Yiqiao2
刊名APPLIED MATHEMATICS LETTERS
出版日期2011-12-01
卷号24期号:12页码:2034-2037
关键词K-4-minor free graph Adjacent vertex-distinguishing edge coloring Maximum degree
ISSN号0893-9659
DOI10.1016/j.aml.2011.05.038
英文摘要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.
资助项目NSFC[11071223] ; ZJNSF[Z6090150] ; ZJNSF[Z6110786] ; ZJIP[T200905] ; [ZSDZZZZXK08]
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000294886000013
出版者PERGAMON-ELSEVIER SCIENCE LTD
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/12177]  
专题中国科学院数学与系统科学研究院
通讯作者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.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

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