42 citations · 153 across the 70 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 6 cited
Towards on-line Ohba's conjecture
Jakub Kozik, Piotr Micek, Xuding Zhu
The on-line choice number of a graph is a variation of the choice number defined through a two person game. It is at least as large as the choice number for all graphs and is stric…
math.CO2011
Colouring Edges with many Colours in Cycles
Jaroslav Nesetril, Patrice Ossona De Mendez, Xuding Zhu
The arboricity of a graph G is the minimum number of colours needed to colour the edges of G so that every cycle gets at least two colours. Given a positive integer p, we define th…