An Improved Upper Bound on Edge Weight Choosability of Graphs

doi:10.1007/s00373-014-1479-0

CSpace > 应用数学研究所

	An Improved Upper Bound on Edge Weight Choosability of Graphs
	Wang, Guanghui 1; Yan, Guiying2
	2015-09-01
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	31 期号:5 页码:1789-1793
摘要	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 .
关键词	1-2-3 Conjecture Edge weight choosability
DOI	10.1007/s00373-014-1479-0
语种	英语
资助项目	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类目	Mathematics
WOS记录号	WOS:000360192700052
出版者	SPRINGER JAPAN KK
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/20687
专题	应用数学研究所
通讯作者	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.