关于可嵌入曲面图的列表(d,1)-全标号问题(英文)  

List(d,1)-Total Labelling of Graphs Embedded in Surfaces

作　　者：于永[1] 张欣[1] 刘桂真[1] 

机构地区：[1]山东大学数学学院,济南250100

出　　处：《运筹学学报》2011年第3期29-37,共9页Operations Research Transactions

基　　金：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.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 Chd,1^T（G） of G is at most △（G） ＋ 2d.

关 键 词：(D 1)-全标号 列表(d 1)-全标号 列表(d 1)-全标号数 图 

分 类 号：O157.5[理学—数学]