---
tag: GPDATQ24XP
kind: concept
name: Forbidden
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section F
    note: adopted
    mention: wikipedia://en/325802#90T0
    sections: [Summary]
inventory: [QEEJFMB28V]
---

## Summary

A forbidden graph characterization is a characterization of a family of graphs as being the graphs that do not have certain other graphs as subgraphs, induced subgraphs, or minors. If $H$ is one of the graphs that does not occur as a subgraph, induced subgraph, or minor, then $H$ is said to be forbidden.