Arrangeable graph

Материал из WikiGrapp
Перейти к:навигация, поиск

Arrangeable graphаранжируемый граф.

A cf-graph is called arrangeable if its arrangement exists and nonarrangeable otherwise.

Every arc of an arrangeable graph G is either forward or backward arc. An arc of G is called a backward arc if it is an F-inverse arc for an arrangement of G and a forward arc if it is an F-direct arc for an arrangement of G.

A depth of an arrangeable graph G is defined as the depth of an arrangement of G.

Литература

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