Arrangeable graph: различия между версиями

Arrangeable graph (посмотреть исходный код)

79 байт добавлено , 6 декабря 2011

нет описания правки

4625

правок

@@ Строка 1: / Строка 1: @@
-'''Arrangeable graph''' --- аранжируемый граф.
+'''Arrangeable graph''' — ''[[аранжируемый граф]].''
-A ''cf-graph''is called '''arrangeable''' if its ''arrangement''exists and
+A ''[[cf-Graph|cf-graph]]'' is called '''arrangeable''' if its ''[[arrangement]]''exists and
 '''nonarrangeable''' otherwise.
-Every arc of an arrangeable graph <math>G</math> is either forward or backward arc.
+Every [[arc]] of an arrangeable [[graph, undirected graph, nonoriented graph|graph]] <math>G</math> is either forward or backward arc.
-An arc of <math>G</math> is called a '''backward''' arc if it is
+An arc of <math>G</math> is called a '''backward''' arc if it is an ''<math>F</math>-inverse arc'' for an arrangement of <math>G</math> and a '''forward''' arc if it is an ''<math>F</math>-direct arc'' for an arrangement of <math>G</math>.
-an ''<math>F</math>-inverse arc''for an arrangement of <math>G</math> and
-a '''forward''' arc if it is an ''<math>F</math>-direct arc''for
-an arrangement of <math>G</math>.
-A '''depth''' of an arrangeable graph <math>G</math> is defined
+A '''depth''' of an arrangeable graph <math>G</math> is defined as the depth of an arrangement of <math>G</math>.
-as the depth of an arrangement of <math>G</math>.