Strong tournaments with the fewest Hamiltonian paths

Authors

  • Moon J.W.
  • Yang, Laura L. M.

Abstract

Busch recently determined the minimum number of Hamiltonian paths a strong tournament can have. We characterize the strong tournaments that realize this minimum.

Published

2007-05-09

How to Cite

Moon J.W., & Yang, Laura L. M. (2007). Strong tournaments with the fewest Hamiltonian paths. Utilitas Mathematica, 72. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/513

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.