1 paper
Lilian Marey, Paul Hilaire, Charlotte Laclau
The edge-girth of an edge e in a simple connected graph is the length of a shortest cycle containing e, with ge=∞ if no such cycle exists. The edge-girth sequence of…