When you run DFS on a graph, you create a DFS tree. Tree edges are the edges you traverse during DFS. Back edges connect a vertex to its ancestor in the DFS tree. Tree edges form the skeleton. Back edges create cycles by connecting descendants back to ancestors.
A core concept: an edge is a bridge if and only if it is a tree edge with no back edge crossing it. Back edges provide alternate paths, preventing bridges.