3 papers
math.CO2023
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 ,…
math.CO2023
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…
math.CO2012
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…