 Some facility location problems which are NP-hard for general graphs, as well as some other graph problems, may be solved in polynomial time for cacti.Since cacti are special cases of outerplanar graphs, a number of combinatorial optimization problems on graphs may be solved for them in polynomial time.Cacti represent electrical circuits that have useful properties.