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

'''Arrangeable graph''' — ''[[аранжируемый граф]].''

A ''[[cf-Graph|cf-graph]]'' is called '''arrangeable''' if its ''[[arrangement]]''exists and

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 ''<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 as the depth of an arrangement of <math>G</math>.

 

 

* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.