Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio

We give an exact characterization of monotone graph classes C with bounded average degree that satisfy the following property: The domination number of every graph from C is bounded by a linear function of its 2-independence number.