Antidirected path

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

Antidirected pathантиориентированный путь.

An antidirected path in a digraph is a simple path, every two adjacent arcs of which have opposite orientations, i.e. no two consecutive arcs of the path form a directed path. An antidirected Hamiltonian path in a digraph is a simple antidirected path containing all the vertices. Similarly, an antidirected Hamiltonian cycle is defined.