1 citations · 1 across the 7 of their papers we have counts for
3 papers · 1 filter
A structural description of Zykov and Blanche Descartes graphs
Malory Marin, Stéphan Thomassé, Nicolas Trotignon +1
In 1949, Zykov proposed the first explicit construction of triangle-free graphs with arbitrarily large chromatic number. We define a Zykov graph as any induced subgraph of a graph…
Channel allocation revisited through 1-extendability of graphs
Anthony Busson, Malory Marin, Rémi Watrigant
We revisit the classical problem of channel allocation for Wi-Fi access points (AP). Using mechanisms such as the CSMA/CA protocol, Wi-Fi access points which are in conflict within…
Beyond recognizing well-covered graphs
Carl Feghali, Malory Marin, Rémi Watrigant
We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let and be positive integers and let be a graph. Then is sa…