On L(2,1)-Labelings of Oriented Graphs

Colucci, Lucas; Gyori, Ervin

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

On L(2,1)-Labelings of Oriented Graphs

Full text
Author(s):	Colucci, Lucas ^[1] ; Gyori, Ervin Total Authors: 2
Affiliation:	^[1] Hungarian Acad Sci, Alfred Renyi Inst Math, Realtanoda U 13-15, H-1053 Budapest - Hungary Total Affiliations: 1
Document type:	Journal article
Source:	DISCUSSIONES MATHEMATICAE GRAPH THEORY; v. 42, n. 1, p. 39-46, FEB 1 2022.
Web of Science Citations:	0
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. (AU)

FAPESP's process:	13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science
Grantee:	Carlos Eduardo Ferreira
Support Opportunities:	Research Projects - Thematic Grants

Short URL