Example: Minimum number of colors in graph coloring
Suppose traverse tree to leaf and find valid coloring with k colors
Suppose later, after backtracking, reach a vertex that requires a (k+1)st color => can backtrack.
In example, k serves as a bound for backtracking.