Cotree, co-tree

Cotree, co-tree --- кодерево (графа).

Let [math]\displaystyle{ T }[/math] be a spanning tree of [math]\displaystyle{ G }[/math]. A cotree of [math]\displaystyle{ G }[/math] is a graph induced by edges that do not belong to [math]\displaystyle{ T }[/math]. Any edge of a cotree is called a chord of the spanning-tree.