21 citations · 21 across the 3 of their papers we have counts for
5 papers · 1 filter
Strongly proper connected coloring of graphs
Michał Dębski, Jarosław Grytczuk, Paweł Naroski +1
We study a new variant of \emph{connected coloring} of graphs based on the concept of \emph{strong} edge coloring (every color class forms an \emph{induced} matching). In particula…
Centroidal localization game
Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk +3
One important problem in a network is to locate an (invisible) moving entity by using distance-detectors placed at strategical locations. For instance, the metric dimension of a gr…
Localization game on geometric and planar graphs
Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk +3
The main topic of this paper is motivated by a localization problem in cellular networks. Given a graph we want to localize a walking agent by checking his distance to as few v…
Clique number of the square of a line graph
Małgorzata Śleszyńska-Nowak
An \emph{edge coloring} of a graph is strong if each color class is an induced matching of . The \emph{strong chromatic index} of , denoted by , is th…
Strong chromatic index of sparse graphs
Michał Dębski, Jarosław Grytczuk, Małgorzata Śleszyńska-Nowak
A coloring of the edges of a graph is strong if each color class is an induced matching of . The strong chromatic index of , denoted by , is the least…