Yong Yu, Xin Zhang, Guizhen Liu
Published 2011-05-09Version 1
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 $\epsilon$ whose maximum degree $\Delta(G)$ is sufficiently large. We prove that the (d,1)-total choosability $C_{d,1}^T(G)$ of $G$ is at most $\Delta(G)+2d$.
List version of ($p$,1)-total labellings
New upper bounds for the bondage number of a graph in terms of its maximum degree and Euler characteristic
One can hear the Euler characteristic of a simplicial complex
![QR code for arXiv:1105.1639 [math.CO]](http://oss.arxitics.com/images/favicon.svg)