Graph amalgamation

In graph theory, a graph amalgamation is a relationship between two graphs. Similar relationships include subgraphs and minors. Amalgamations can provide a way to reduce a graph to a simpler graph while keeping certain structure intact. The amalgamation can then be used to study properties of the original graph in an easier to understand context. Applications include embeddings, computing genus distribution, and Hamiltonian decompositions.

This keyword could refer to multiple things. Here are some suggestions: