3 citations · 3 across the 8 of their papers we have counts for
4 papers · 1 filter
Incidence, a Scoring Positional Game on Graphs
Guillaume Bagan, Quentin Deschamps, Eric Duchêne +5
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investigated in the literature since then. These games are played on a hypergraph where…
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…
Partitioning into degenerate graphs in linear time
Timothée Corsini, Quentin Deschamps, Carl Feghali +3
Let be a connected graph with maximum degree distinct from . Generalizing Brooks' Theorem, Borodin, Kostochka and Toft proved that if are…
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…