List (d,1)-total labelling of graphs embedded in surfaces

Details List (d,1)-total labelling of graphs embedded in surfaces List (d,1)-total labelling of graphs embedded in surfaces

2011-05-09

arxiv.org/abs/1105.1639v1

Mathematics

Combinatorics

6 pages

Scientific paper

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$.

Affiliated with

Also associated with

No associations

Rating

List (d,1)-total labelling of graphs embedded in surfaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with List (d,1)-total labelling of graphs embedded in surfaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and List (d,1)-total labelling of graphs embedded in surfaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-333846