  Castelnuovo-Mumford regularity is a measure of algebraic complexity of an
ideal. Regularity of monomial ideals can be investigated combinatorially. We
use a simple graph decomposition and results from structural graph theory to
prove, improve and generalize many of the known bounds on regularity of
quadratic square-free monomial ideals.
