1 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DS2021
Faster 3-coloring of small-diameter graphs
Michał Dębski, Marta Piecyk, Paweł Rzążewski
We study the 3-\textsc{Coloring} problem in graphs with small diameter. In 2013, Mertzios and Spirakis showed that for -vertex diameter-2 graphs this problem can be solved in su…
math.CO2020★ 1 cited
Conflict-free chromatic number vs conflict-free chromatic index
Michał Dębski, Jakub Przybyło
A vertex coloring of a given graph is conflict-free if the closed neighborhood of every vertex contains a unique color (i.e. a color appearing only once in the neighborhood). T…
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…