arXiv Analytics

Sign in

arXiv:1902.05467 [math.CO]AbstractReferencesReviewsResources

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

Lucas Colucci, Ervin Győri

Published 2019-02-14Version 1

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.

Comments: 7 pages
Categories: math.CO
Subjects: 05C78, 05C20
Related articles: Most relevant | Search more
arXiv:0903.2184 [math.CO] (Published 2009-03-12, updated 2012-09-11)
Flip Graphs of Degree-Bounded (Pseudo-)Triangulations
arXiv:1203.0379 [math.CO] (Published 2012-03-02)
Equitable Colorings of Planar Graphs without Short Cycles
arXiv:math/0601623 [math.CO] (Published 2006-01-25)
A Strong Edge-Coloring of Graphs with Maximum Degree 4 Using 22 Colors

Links

Toolbox