| 关于可嵌人曲面图的列表(d,1)-全标号问题 |
| |
| 引用本文： | 于永,张欣,刘桂真.关于可嵌人曲面图的列表(d,1)-全标号问题[J].运筹学学报,2011,15(3):29-37. |
| |
| 作者姓名： | 于永 张欣 刘桂真 |
| |
| 作者单位： | 山东大学数学学院 |
| |
| 基金项目： | Graduate Independent Innovation Foundation of Shandong University(yzc11025); National Natural Science Foundation of China(61070230,11026184,10901097); Research Fund for the Doctoral Program of Higher Education of China(200804220001,20100131120017); the Scientific Research Foundation for the Returned Overseas Chinese Scholars |
| |
| 摘 要： | 图的(d,1)-全标号问题最初是由Havet等人提出的.在本文中,我们考虑了可嵌入曲面图的列表(d,1)-全标号问题,并证明了其列表(d,1)-全标号数不超过△(G)+2d.
|
| 关 键 词： | (d 1)-全标号 列表(d 1)-全标号 列表(d 1)-全标号数 图 |
List (d,1)-Total Labelling of Graphs Embedded in Surfaces |
| |
| YU Yongi,ZHANG Xin,LIU Guizhen.List (d,1)-Total Labelling of Graphs Embedded in Surfaces[J].OR Transactions,2011,15(3):29-37. |
| |
| Authors: | YU Yongi ZHANG Xin LIU Guizhen |
| |
| Institution: | YU Yong ZHANG Xin LIU Guizhen School of Mathematics,Shandong University,Jinan 250100,China |
| |
| Abstract: | The (d,1)-total labelling of graphs was introduced by Havet and Yu.In this paper,we consider the list version of (d,1)-total labelling of graphs.Let G be a graph embedded in a surface with Euler characteristic ε whose maximum degree △(G) is sufficiently large.We prove that the list (d,1)-total labelling number ChTd,1(G) of G is at most △(G) + 2d. |
| |
| Keywords: | (d 1)-total labelling list (d 1)-total labelling list (d 1)-total labelling number graphs |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《运筹学学报》浏览原始摘要信息 |
| 点击此处可从《运筹学学报》下载免费的PDF全文 |
|
