北大中文核心期刊
中国科学引文数据库（CSCD）来源期刊
中国科技核心期刊
入选数学领域高质量科技期刊
Scopus
EBSCO 

运筹学学报 ›› 2011, Vol. 15 ›› Issue (3): 29-37.

• 运筹学 • 上一篇    下一篇

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

 于永, 张欣, 刘桂真   

  • 出版日期:2011-09-20 发布日期:2011-09-20

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

 YU  Yong, ZHANG  Xin, LIU  Gui-Zhen   

  • Online:2011-09-20 Published:2011-09-20

PDF

1321

摘要： 图的(d,1)-全标号问题最初是由Havet等人提出的. 在本文中，我们考虑了可嵌入曲面图的列表(d,1)-全标号问题,并证明了其列表(d,1)-全标号数不超过$\Delta(G)+2d.$  

关键词: (d,1)-全标号, 列表(d,1)-全标号, 列表(d,1)-全标号数, 图

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 $\varepsilon$ whose maximum degree $\Delta(G)$
is sufficiently large. We prove that the list ($d$,1)-total labelling number
$Ch_{d,1}^{\rm T}(G)$ of $G$ is at most $\Delta(G)+2d$.

Key words: (d,1)-total labelling, list (d,1)-total labelling, list (d,1)-total labelling number, graphs