%A Colucci, Lucas
%D 2021
%T On L(h,k)-labelings of oriented graphs
%K
%X We compare the behaviour of the $L(h,k)$-number of undirected and oriented graphs in terms of maximum degree, highlighting differences between the two contexts. In particular, we prove that, for every $h$ and $k$, oriented graphs with bounded degree in every block of their underlying graph (for instance, oriented trees and oriented cacti) have bounded $L(h,k)$-number, giving an upper bound on this number which is sharp up to a multiplicative factor $4$.
%U https://sol.sbc.org.br/index.php/etc/article/view/16382
%J Anais do Encontro de Teoria da Computação (ETC)
%0 Journal Article
%R 10.5753/etc.2021.16382
%P 66-69%@ 2595-6116
%8 2021-07-18