Total weight choosability of Cartesian product of graphs
Total weight choosability of Cartesian product of graphs
复制标题
图的笛卡尔积的总权重可选择性
DOI：
10.1016/j.ejc.2012.04.004
复制
发表时间：
2012-11
影响因子：
1
通讯作者：
朱绪鼎
中科院分区：
文献类型：
--
作者：
朱绪鼎
A graph G=(V,E) is called (k,k′)-choosable if the following is true: for any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, and assigns to each edge e a set L(e) of k′real numbers, there is a mapping f:V∪E→R such that f(y)∈L(y) for any y∈V∪E and for any two adjacent vertices x,x′, [Formula: see text] . In this paper, we prove that if G is the Cartesian product of an even number of even cycles, or the Cartesian product of an odd number of even cycles and at least one of the cycles has length 4n for some positive integer n, then G is (1,3)-choosable. In particular, hypercubes of even dimension are (1,3)-choosable. Moreover, we prove that if G is the Cartesian product of two paths or the Cartesian product of a path and an even cycle, then G is (1,3)-choosable. In particular, Q3is (1,3)-choosable.
登录
查看更多内容
DOI：
10.1016/j.jctb.2005.01.001
发表时间：
2005-07
期刊：
J. Comb. Theory B
影响因子：
--
作者：
L. Addario-Berry;R. Aldred;Ketan Dalal;B. Reed
通讯作者：
L. Addario-Berry;R. Aldred;Ketan Dalal;B. Reed
影响因子：
0.9
作者：
A. Bonato;J. Janssen;Changping Wang
通讯作者：
A. Bonato;J. Janssen;Changping Wang
影响因子：
1.1
作者：
L. Addario-Berry;Ketan Dalal;C. McDiarmid;B. Reed;A. Thomason
通讯作者：
L. Addario-Berry;Ketan Dalal;C. McDiarmid;B. Reed;A. Thomason
影响因子：
15.1
作者：
T. Wong;Xuding Zhu;Daqing Yang
通讯作者：
T. Wong;Xuding Zhu;Daqing Yang
影响因子：
1.1
作者：
N. Alon;M. Tarsi
通讯作者：
N. Alon;M. Tarsi