The problem of minimizing the number of links and buses in a digital system subject to a given set of concurrency constraints among data transfers is studied. The notion of the transfer graph (TG) is introduced which depicts the data transfer paths and concurrency requirements in the system, A very simple node labelling procedure is applied on the nodes of the TG, which enables one to make a direct assignment of transfers to buses without going through any elaborate computational steps.