An acyclic orientation of a directed graph (digraph) is an assignment of directions to the edges of the graph such that there are no directed cycles.

Ancestors (5)

  1. Graph theory objects
  2. Graph theory
  3. Fields of mathematics
  4. Mathematics
  5. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version