Oscar Defrain

activity

20182026

most citedRevisiting a theorem by Folkman on graph colouring

1 citations · 2 across the 16 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DM2018

Enumerating minimal dominating sets in $K_{t}$ -free graphs and variants

Marthe Bonamy, Oscar Defrain, Marc Heinrich +2

It is a long-standing open problem whether the minimal dominating sets of a graph can be enumerated in output-polynomial time. In this paper we investigate this problem in graph cl…

cs.DM2018

Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in $P_{7}$ -free and $P_{8}$ -free chordal graphs

Oscar Defrain, Lhouari Nourine

In [M. M. Kanté, V. Limouzy, A. Mary, and L. Nourine. On the enumeration of minimal dominating sets and related notions. SIAM Journal on Discrete Mathematics, 28(4):1916-1929, 2014…

Enumerating minimal dominating sets in Kt​-free graphs and variants

Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in P7​-free and P8​-free chordal graphs

Enumerating minimal dominating sets in $K_{t}$ -free graphs and variants

Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in $P_{7}$ -free and $P_{8}$ -free chordal graphs