Distance-constrained labellings of Cartesian products of graphs

Anna Lladó, Hamid Mokhtar, Oriol Serra +1

An $L(h_1,h_2,\dots ,h_l)$-labelling of a graph $G$ is a mapping $\varphi :V(G)\to \{0,1,2,\dots \}$ such that for $1\le i\le l$ and each pair of vertices $u,v$ of $G$ at…