标题:Every Toroidal Graph Is Acyclically 8-Choosable
作者:Jian Feng HOU;Gui Zhen LIU;
作者机构:[Jian Feng HOU]Center for Discrete Mathematics,Fuzhou University;[Gui Zhen LIU]School of Mathematics,Shandong University
通讯作者:Hou, J F(jfhou@fzu.edu.cn)
通讯作者地址:[Hou, JF]Fuzhou Univ, Ctr Discrete Math, Fuzhou 350002, Fujian, Peoples R China.
来源:Acta Mathematica Sinica(English Series)
出版年:2014
卷:30
期:2
页码:343-352
DOI:10.1007/s10114-013-1497-5
关键词:Acyclic coloring;choosability;toroidal graph
摘要:A proper coloring of a graphG is acyclic if G contains no 2-colored cycle.A graph G is acyclically L-list colorable if for a given list assignment L=,there exists a proper acyclic coloringφof G such thatφ(v)∈L(v)for all v∈V(G).If G is acyclically L-list colorable for any list assignment...
收录类别:CSCD;SCOPUS;SCIE
WOS核心被引频次:1
Scopus被引频次:1
资源类型:期刊论文
原文链接:http://kns.cnki.net/kns/detail/detail.aspx?FileName=ACMS201402015&DbName=CJFQ2014
TOP