Michał Deͅbski

activity

20172025

k

for complete bipartite graphs

1 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2022

Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws

Michał Dębski, Zbigniew Lonc, Karolina Okrasa +2

For graphs $G$ and $H$ , an $H$ -coloring of $G$ is an edge-preserving mapping from $V (G)$ to $V (H)$ . In the $H$ -Coloring problem the graph $H$ is fixed and we ask whether an instanc…

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 $G$ 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…