We study the problem of the
topological classification of planar polynomial foliations of degree n by giving new
lower and upper bounds for the maximum number of inseparable leaves. Moreover,
we characterize the planar polynomial foliations that are structural stable under
polynomial perturbations and study the exact number of inseparable leaves for this
family.