Paweł Naroski

collaborators

2 papers

math.CO2023

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…

cs.CC2017

Tight Euler tours in uniform hypergraphs - computational aspects

Zbigniew Lonc, Paweł Naroski, Paweł Rzążewski

By a tight tour in a $k$ -uniform hypergraph $H$ we mean any sequence of its vertices $(w_{0}, w_{1}, \dots, w_{s - 1})$ such that for all $i = 0, \dots, s - 1$ the set $e_i=\{w_i,w_{i+1}\ldots,…