A maximal outerplanar graph is a graph formed by a simple polygon in the plane by triangulating its interior.

A subdivision of a graph is a graph formed by subdividing its edges into paths of one or more edges.

A polytree is a directed graph formed by orienting the edges of a free tree.

In combinatorial mathematics, an Apollonian network is an undirected graph formed by a process of recursively subdividing a triangle into three smaller triangles.

The graph formed by connecting two points whenever they are each other's nearest neighbors is necessarily a subgraph of the minimum-weight triangulation.

It has been shown that, for sufficiently small values of θ, the graph formed in this way is a subgraph of the minimum-weight triangulation.

The graphs formed in this way always require k colors in any proper coloring.

The neighborhood of a vertex v is an induced subgraph of the graph, formed by all vertices adjacent to v.

Now consider the graph formed by using the n points as vertices, and the e line segments as edges.

Webgraph is a graph, formed from web pages as vertices and hyperlinks, as directed edges.