5 papers
A note on edge colorings distinguishing all triangles in a graph
Monika Pilsniak, Mariusz Wozniak
We consider edge colorings of a graph in such a way that each two different triangles have distinct colorings. It is an extension of the well-known idea of distinguishing all maxim…
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…
A note on packing of uniform hypergraphs
Jerzy Konarski, Andrzej Żak, Mariusz Woźniak
A packing of two -uniform hypergraphs and is a set of edge-disjoint sub-hypergraphs of the complete -uniform hypergraph such that $H_…
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…
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…