(d,1)-total labelling of graphs with a given maximum average degree
摘要
The (d,1)-total number
ldT(G) of a graph
G is the width of the smallest range of integers that suffices
to label the vertices and the edges of G so that no two
adjacent vertices have the same color, no two incident edges have
the same color and the distance between the color of a vertex and
its incident edges is at least d. In this talk, we prove that
ldT(G)
£D
(G) + 2d - 2 for connected graphs
with a given maximum average degree.
∼Andre Raspaud教授演講摘要∼