edge of a graph whose deletion increases the graph’s number of connected components; equivalently, an edge not contained in any cycle