Login / Signup

Counting orientations of graphs with no strongly connected tournaments.

Fábio BotlerCarlos HoppenGuilherme Oliveira Mota
Published in: Discret. Math. (2022)
Keyphrases
  • strongly connected
  • directed graph
  • optimum path forest
  • undirected graph
  • directed acyclic graph
  • random walk
  • random graphs