7 citations · 18 across the 11 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2016
Fixing improper colorings of graphs
Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff +2
In this paper we consider a variation of a recoloring problem, called the Color-Fixing. Let us have some non-proper -coloring of a graph . We investigate the problem of f…
cs.DM2011★ 6 cited
Determining L(2,1)-Span in Polynomial Space
Konstanty Junosza-Szaniawski, Paweł Rzą\zewski
A -L(2,1)-labeling of a graph is a function from its vertex set into the set , such that the labels assigned to adjacent vertices differ by at least 2, and labels a…