Просмотр кода страницы Z-transformation graph

'''<math>Z</math>-transformation graph''' --- <math>Z</math>-преобразованный граф. 

''' <math>Z</math>-transformation graph''', <math>Z_{F}(G)</math>, of <math>G</math> with respect to a
specific set <math>F</math> of faces is a graph on the perfect matchings of <math>G</math>,
such that two perfect matchings <math>M_{1}</math> and <math>M_{2}</math> are adjacent
provided <math>M_{1}</math> and <math>M_{2}</math> differ only in a cycle that is the
boundary of a face in <math>F</math>. If <math>F</math> is a set of all interior faces,
<math>Z_{F}(G)</math> is a usual <math>Z</math>-transformation graph; if <math>F</math> contains all
faces of <math>G</math> it is a novel graph called the '''total <math>Z</math>-transformation graph'''.