115 citations · 430 across the 53 of their papers we have counts for
4 papers · 1 filter
Scott's induced subdivision conjecture for maximal triangle-free graphs
Nicolas Bousquet, Stéphan Thomassé
Scott conjectured that the class of graphs with no induced subdivision of a given graph is -bounded. We verify his conjecture for maximal triangle-free graphs.
Simultaneously Satisfying Linear Equations Over : MaxLin2 and Max--Lin2 Parameterized Above Average
R. Crowston, M. Fellows, G. Gutin +4
In the parameterized problem \textsc{MaxLin2-AA}[], we are given a system with variables consisting of equations of the form , where $x_i,b…
Hitting and Harvesting Pumpkins
Gwenaël Joret, Christophe Paul, Ignasi Sau +2
The "c-pumpkin" is the graph with two vertices linked by c>0 parallel edges. A c-pumpkin-model in a graph G is a pair A,B of disjoint subsets of vertices of G, each inducing a conn…
The Domination Number of Grids
Daniel Gonçalves, Alexandre Pinlou, Michael Rao +1
In this paper, we conclude the calculation of the domination number of all grid graphs. Indeed, we prove Chang's conjecture saying that for every , $γ(G_{…