The Existence and Uniqueness of Strong Kings in Tournaments
An-Hang Chen, Jou-Ming Chang, Yuwen Cheng, Yue-Li Wang
Discrete Mathematics, Vol. 308, No. 12, (2008) pp. 2629-2633.

The above article has been cited by the articles listed below.
  1. Nathan Muyinda, Bernard De Baets, Shodhan Rao, Non-king elimination, intransitive triad interactions, and species coexistence in ecological competition networks, Theoretical Ecology 13 (2020) 385-397. (*)

  2. Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti, Finding kings in tournaments, Discrete Applied Mathematics 322 (2022) 240-252. (*)

  3. Ziad Ismaili Alaoui, Nikhil Mande, Hardness of finding kings and strong kings, 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2025), Dec. 17-19, 2025, BITS Pilani, K K Birla Goa Campus, India. LIPIcs 360 (2025) 36 (*)

Times cited: 3 (from Web of Science)