Showing cs.DMShow all
3 papers · 1 filter
cs.DM2019
A note on the neighbour-distinguishing index of digraphs
Eric Sopena, Mariusz Woźniak
In this note, we introduce and study a new version of neighbour-distinguishing arc-colourings of digraphs. An arc-colouring of a digraph is proper if no two arcs with the s…
cs.DM2017
Equitable neighbour-sum-distinguishing edge and total colourings
Olivier Baudon, Monika Pilsniak, Jakub Przybylo +3
With any (not necessarily proper) edge -colouring of a graph ,one can associate a vertex colouring given by $σ\_γ(v)=\sum\_{e\ni v…
cs.DM2014
Labeled embedding of (n,n-2)-graphs in their complements
M. A. Tahraoui, E. Duchene, H. Kheddouci +1
Graph packing generally deals with unlabeled graphs. In \cite{EHRT11}, the authors have introduced a new variant of the graph packing problem, called the \textit{labeled packing of…