Graph minor

The concept of a graph minor is a fundamental notion in graph theory, particularly in the study of graph structure and graph algorithms. A graph \( H \) is said to be a **minor** of another graph \( G \) if \( H \) can be formed from \( G \) by performing a series of operations that includes: 1. **Edge Deletion**: Removing edges from the graph. 2. **Vertex Deletion**: Removing vertices and incident edges from the graph.