Showing math.COShow all
2 papers · 1 filter
math.CO2023
Sparse vertex cutsets and the maximum degree
Stéphane Bessy, Johannes Rauch, Dieter Rautenbach +1
We show that every graph of maximum degree and sufficiently large order has a vertex cutset of order at most that induces a subgraph of maximum degree at mos…
math.CO2014
Two floor building needing eight colors
Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni
Motivated by frequency assignment in office blocks, we study the chromatic number of the adjacency graph of -dimensional parallelepiped arrangements. In the case each parallelep…