The terminology arises because the circuits of graphic matroids are cycles in the corresponding graphs.

Consider a function with its corresponding graph as a subset of the Cartesian product .

Intuitively, this means that the corresponding graph has a directed edge from to .

The corresponding graph contains a vertex for every job and an edge for every conflicting pair of jobs.

In this case the rigidity matroid of a framework is the same as the graphic matroid of the corresponding graph.

In order to represent any network, it is necessary to characterize the properties of the corresponding graph of nodes and links.

Every problem can be made strongly directionally -consistent, but this operation may increase the width of its corresponding graphs.

The corresponding graph representing this statement can be seen.

This gives the corresponding "modal graph" which is total complete ("i.e.", no more edges (relations) can be added).

That is, the girth of the corresponding bipartite graph (the Levi graph of the configuration) must be at least six.