KnowraGraph minorLinked fromLinked fromThe 9 pages that link to Graph minor, each with the reason it gives.All 9Related 3Narrower topic 2Compared with 4Graph embeddingCompared with: Minor containment permits contractions, unlike ordinary subgraph embeddings.Induced subgraphCompared with: Minor operations allow deletions and contractions beyond induced-subgraph selection.Graph homomorphismCompared with: Minor containment permits contractions and deletions, a different relation from edge-preserving vertex maps.Robertson–Seymour theoremNarrower topic: The theorem’s ordering relation compares graphs by whether one is a minor of another.Spectral graph theoryCompared with: Minor-based structure captures properties that a graph’s spectrum may not determine.Wagner's theoremRelated: The theorem helped make the minor relation central to structural graph theory.Edge contractionRelated: Repeated edge contractions, together with deletions, produce graph minors.Erdős–Pósa theoremRelated: Later structural results connect packing-covering behavior to minor-closed graph families.Graph structure theoremNarrower topic: The theorem classifies graph families by which fixed graph they exclude as a minor.