12 citations · 12 across the 4 of their papers we have counts for
4 papers
Cooperative coloring of matroids
Tomasz Bartnicki, Sebastian Czerwiński, Jarosław Grytczuk +1
Let be a collection of matroids on the same ground set . A coloring is called \emph{cooperative} if for every color ,…
Strong arboricity of graphs
Tomasz Bartnicki, Sebastian Czerwiński, Jarosław Grytczuk +1
An edge coloring of a graph is \emph{woody} if no cycle is monochromatic. The \emph{arboricity} of a graph , denoted by $\arb (G)$, is the least number of colors needed for…
Total Game Coloring of Graphs
Tomasz Bartnicki, Zofia Miechowicz
Total variant of well known graph coloring game is considered. We determine exact values of total game chromatic number for some classes of graphs and show show the strategie for f…
Additive colorings of planar graphs
Tomasz Bartnicki, Bartłomiej Bosek, Sebastian Czerwiński +3
An \emph{additive coloring} of a graph is an assignment of positive integers to the vertices of such that for every two adjacent vertices the sums of number…