Graphs such that every two edges are contained in a shortest cycle (Q1122590)

The authors characterize the graphs in which every two edges are in a shortest cycle. These graphs are the uniform subdivisions of the regular or semi-regular graphs of diameter d and girth 2d or of the multigraphs on two vertices. They also investigate the graphs in which every path of length m is contained in a shortest cycle and show that these graphs do not have a similar characterization.