Combinatorial dual graph, combinatorically dual graph

Combinatorial dual graph, combinatorically dual graph --- комбинаторно двойственный граф.

A graph [math]\displaystyle{ G }[/math] is a combinatorial dual graph to a graph [math]\displaystyle{ G^{\ast} }[/math], if there exists a one-to-one mapping [math]\displaystyle{ e: E(G) \rightarrow E(G^{\ast}) }[/math] of the edge set of [math]\displaystyle{ G }[/math] onto the edge set of [math]\displaystyle{ G^{\ast} }[/math] such that [math]\displaystyle{ C }[/math] is a circuit of [math]\displaystyle{ G }[/math] if and only if [math]\displaystyle{ e(C) }[/math] is a cocircuit of [math]\displaystyle{ G^{\ast} }[/math].