On L(2,1)-labelings of oriented graphs

Lucas Colucci; Ervin Győri

doi:10.7151/dmgt.2240

On L(2,1)-labelings of oriented graphs

Combinatorics 2020-04-22 v1

Authors: Lucas Colucci , Ervin Győri

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

We extend a result of Griggs and Yeh about the maximum possible value of the L(2,1)-labeling number of a graph in terms of its maximum degree to oriented graphs. We consider the problem both in the usual definition of the oriented L(2,1)-labeling number and in some variants we introduce.

Keywords

graph theory

Cite

@article{arxiv.1902.05467,
  title  = {On L(2,1)-labelings of oriented graphs},
  author = {Lucas Colucci and Ervin Győri},
  journal= {arXiv preprint arXiv:1902.05467},
  year   = {2020}
}

Comments

7 pages

Related papers

View all related →