A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno. A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. J. Discrete Algorithms, 14:189-206, 2012. [doi]

@article{HasunumaIOU12-0,
  title = {A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs},
  author = {Toru Hasunuma and Toshimasa Ishii and Hirotaka Ono and Yushi Uno},
  year = {2012},
  doi = {10.1016/j.jda.2011.12.020},
  url = {http://dx.doi.org/10.1016/j.jda.2011.12.020},
  researchr = {https://researchr.org/publication/HasunumaIOU12-0},
  cites = {0},
  citedby = {0},
  journal = {J. Discrete Algorithms},
  volume = {14},
  pages = {189-206},
}