-
About Randomised Distributed Graph Colouring and Graph Partition Algorithms
International audience -
On the Time and the Bit Complexity of Distributed Randomised Anonymous Ring C...
International audience -
Choosability of the square of planar subcubic graphs with large girth
We first show that the choose number of the square of a subcubic graph with maximum average degree less than 18/7 is at most 6. As a corollary, we get that the choose... -
Circular Choosability
In this paper, we study the notion of circular choosability recently introduced by Mohar and Zhu. First, we provide a negative answer to a question of Zhu about...
