Просмотр кода страницы Fraternally oriented digraph

'''Fraternally oriented digraph''' --- братски ориентированный  граф.

A digraph <math>D</math> is called a '''fraternal orientation''' of <math>G_{D}</math> if
<math>(u,w) \in A(D)</math> and <math>(v,w) \in A(D)</math> implies <math>(u,v) \in A(D)</math> or
<math>(v,u) \in A(D)</math>. If <math>D</math> is a fraternal orientation of <math>G_{D}</math>, we will
say that <math>D</math> is a '''fraternally oriented digraph''', <math>G</math> is '''fraternally orientable''' if it admits a fraternal orientation.