2 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…