  We present a mathematical framework for describing the topology of
configuration spaces for particles on one-connected graphs. In particular, we
compute the homology groups over integers for different classes of
one-connected graphs. Our approach is based on some fundamental combinatorial
properties of the configuration spaces, Mayer-Vietoris sequences for different
parts of configuration spaces and some limited use of discrete Morse theory. As
one of the results, we derive a closed-form formulae for ranks of the homology
groups for indistinguishable particles on tree graphs. We also give a detailed
discussion of the second homology group of the configuration space of both
distinguishable and indistinguishable particles. Our motivation is the search
for new kinds of quantum statistics.
