标题:Graphs are (1, Delta+1)-choosable
作者:Ding, Laihao; Duh, Guan-Huei; Wang, Guanghui; Wong, Tsai-Lien; Wu, Jianliang; Yu, Xiaowei; Zhu, Xuding
作者机构:[Ding, Laihao] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Hubei, Peoples R China.; [Duh, Guan-Huei] Natl Taiwan Univ, Dept Math, Taipei 更多
通讯作者:Zhu, XD
通讯作者地址:[Zhu, XD]Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China.
来源:DISCRETE MATHEMATICS
出版年:2019
卷:342
期:1
页码:279-284
DOI:10.1016/j.disc.2018.10.004
关键词:Total weighting; (k,k')-choosable graphs; Permanent
摘要:A graph G is (k, k')-choosable if the following holds: For any list assignment L which assigns to each vertex upsilon a set L(upsilon) of k real numbers, and assigns to each edge e a set L(e) of k' real numbers, there is a total weighting empty set : V(G) boolean OR E(G)-> R such that empty set(z) is an element of L(z) for z is an element of V boolean OR E, and Sigma(eEE(u)) empty set(e) + empty set(u) not equal Sigma(eeE)(upsilon) empty set(e)+ empty set(upsilon) for every edge u upsilon. This paper proves that if G is a connected graph of maximum degree Delta >= 2, then G is (1, Delta + 1)-choosable. (C) 2018 Published by Elsevier B.V.
收录类别:SCOPUS;SCIE
资源类型:期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85055483727&doi=10.1016%2fj.disc.2018.10.004&partnerID=40&md5=36e7397bdeb11a01c696baa2b28d1898
TOP