13 citations · 27 across the 10 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2018
Intersecting edge distinguishing colorings of hypergraphs
Karolina Okrasa, Paweł Rzążewski
An edge labeling of a graph distinguishes neighbors by sets (multisets, resp.), if for any two adjacent vertices and the sets (multisets, resp.) of labels appearing on edge…
cs.DM2017★ 13 cited
On edge intersection graphs of paths with 2 bends
Martin Pergel, Paweł Rzążewski
An EPG-representation of a graph is a collection of paths in a plane square grid, each corresponding to a single vertex of , so that two vertices are adjacent if and only if…
cs.DM2017★ 1 cited
Sequences of radius for complete bipartite graphs
Michał Dębski, Zbigniew Lonc, Paweł Rzążewski
A \emph{-radius sequence} for a graph is a sequence of vertices of (typically with repetitions) such that for every edge of vertices and appear at least…