Tomasz Bartnicki

most citedAdditive colorings of planar graphs

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

collaborators

3 papers

math.CO2023

Cooperative coloring of matroids

Tomasz Bartnicki, Sebastian Czerwiński, Jarosław Grytczuk +1

Let $M_{1}, M_{2}, \dots, M_{k}$ be a collection of matroids on the same ground set $E$ . A coloring $c : E \to {1, 2, \dots, k}$ is called \emph{cooperative} if for every color $j$ ,…

math.CO2023

Strong arboricity of graphs

Tomasz Bartnicki, Sebastian Czerwiński, Jarosław Grytczuk +1

An edge coloring of a graph $G$ is \emph{woody} if no cycle is monochromatic. The \emph{arboricity} of a graph $G$ , denoted by $\arb (G)$, is the least number of colors needed for…

math.CO2012★ 12 cited

Additive colorings of planar graphs

Tomasz Bartnicki, Bartłomiej Bosek, Sebastian Czerwiński +3

An \emph{additive coloring} of a graph $G$ is an assignment of positive integers ${1, 2, ..., k}$ to the vertices of $G$ such that for every two adjacent vertices the sums of number…