Brešar, Boštjan; Hartnell, Bert L.; Rall, Douglas F. (University of PrimorskaSlovenian Society of Discrete and Applied MathematicsSociety of Mathematicians, Physicists and Astronomers of SloveniaInstitute of Mathematics, Physics and Mechanics, 2017-03-09)

A set *D* of vertices in a graph *G* is called a dissociation set if every vertex in *D* has at most one neighbor in *D*. We call a graph *G* uniformly dissociated if all maximal dissociation ...