3 citations · 4 across the 13 of their papers we have counts for
4 papers · 1 filter
The smallest 5-chromatic tournament
Thomas Bellitto, Nicolas Bousquet, Adam Kabela +1
A coloring of a digraph is a partition of its vertex set such that each class induces a digraph with no directed cycles. A digraph is -chromatic if is the minimum number of…
Square coloring planar graphs with automatic discharging
Nicolas Bousquet, Lucas de Meyer, Quentin Deschamps +1
The discharging method is a powerful proof technique, especially for graph coloring problems. Its major downside is that it often requires lengthy case analyses, which are sometime…
What can be certified compactly?
Nicolas Bousquet, Laurent Feuilloley, Théo Pierron
Local certification consists in assigning labels (called \emph{certificates}) to the nodes of a network to certify a property of the network or the correctness of a data structure…
Strengthening a theorem of Meyniel
Quentin Deschamps, Carl Feghali, František Kardoš +2
For an integer and a graph , let be the graph that has vertex set all proper -colorings of , and an edge between two vertices and~ whe…