A short update on equipackable graphs

A graph is called equipackable if every maximal packing in it is also maximum. This generalizes randomly packable graphs. We survey known results both on randomly packable graphs and on equipackable graphs. As a new result is given a characterization of P3P3-equipackable graphs with all valencies at least two.