中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 数学与系统科学研究院
  3. 中国科学院数学与系统科学研究院
  4. 应用数学研究所
An Improved Upper Bound on Edge Weight Choosability of Graphs

文献类型：期刊论文

作者Wang, Guanghui1; Yan, Guiying2
刊名GRAPHS AND COMBINATORICS
出版日期2015-09-01
卷号31期号:5页码:1789-1793
关键词1-2-3 Conjecture Edge weight choosability
ISSN号0911-0119
DOI10.1007/s00373-014-1479-0
英文摘要The famous 1-2-3 conjecture due to KaroA"ski, Auczak and Thomason states that the edges of any nice graph (without a component isomorphic to ) may be weighted from the set {1,2,3} so that the vertices are properly coloured by the sums of their incident edge weights. Bartnicki, Grytczuk and Niwcyk introduced its list version. Assign to each edge a list of real numbers, say , and choose a weight for each . The resulting function is called an edge -list-weighting. Given a graph , the smallest such that any assignment of lists of size to permits an edge -list-weighting which is a vertex coloring by sums is denoted by and called the edge weight choosability of . Bartnicki, Grytczuk and Niwcyk conjectured that if is a nice graph, then . There is no known constant such that for any nice graph . Fu et al. proved that for a nice graph with maximum degree , . In this paper, we improve this bound to .
资助项目National Natural Science Foundation of China[11101243] ; National Natural Science Foundation of China[11471193] ; National Natural Science Foundation of China[61373027] ; National Natural Science Foundation of China[11371355] ; Scientific Research Foundation for the Excellent Middle-Aged and Young Scientists of Shandong Province[BS2012SF016] ; Independent Innovation Foundation of Shandong University[IFYT 14012]
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000360192700052
出版者SPRINGER JAPAN KK
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/20686]  
专题应用数学研究所
通讯作者Wang, Guanghui
作者单位1.Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 10080, Peoples R China
推荐引用方式
GB/T 7714		 Wang, Guanghui,Yan, Guiying. An Improved Upper Bound on Edge Weight Choosability of Graphs[J]. GRAPHS AND COMBINATORICS,2015,31(5):1789-1793.
APA Wang, Guanghui,&Yan, Guiying.(2015).An Improved Upper Bound on Edge Weight Choosability of Graphs.GRAPHS AND COMBINATORICS,31(5),1789-1793.
MLA Wang, Guanghui,et al."An Improved Upper Bound on Edge Weight Choosability of Graphs".GRAPHS AND COMBINATORICS 31.5(2015):1789-1793.

入库方式： OAI收割

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

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

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