Antidirected path: различия между версиями

'''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 [[vertex|vertices]]. Similarly, an '''[[antidirected Hamiltonian cycle]]''' is defined.