(2,1)-Total labeling of planar graphs with large maximum degree
Combinatorics
2011-05-11 v1 Discrete Mathematics
Abstract
The (,1)-total labelling of graphs was introduced by Havet and Yu. In this paper, we prove that, for planar graph with maximum degree and , the (2,1)-total labelling number is at most .
Keywords
Cite
@article{arxiv.1105.1908,
title = {(2,1)-Total labeling of planar graphs with large maximum degree},
author = {Yong Yu and Xin Zhang and Guanghui Wang and Jinbo Li},
journal= {arXiv preprint arXiv:1105.1908},
year = {2011}
}
Comments
9 pages, 1 figure