Kings in strong tournaments.
From MaRDI portal
Publication:2829005
Recommendations
Cited in
(18)- On the Complexity of Kings
- Finding kings in tournaments
- scientific article; zbMATH DE number 3880740 (Why is no real title available?)
- scientific article; zbMATH DE number 4025468 (Why is no real title available?)
- Kings in hypertournaments
- Weak king embeddings of oriented graphs
- scientific article; zbMATH DE number 3952826 (Why is no real title available?)
- Kings in locally semicomplete digraphs
- Kings in multipartite tournaments and hypertournaments
- \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs
- On the complexity of kings
- Kings in products of digraphs
- Searching for Sorted Sequences of Kings in Tournaments
- Common kings of a chain of cycles in a strong tournament
- Kings in quasi-transitive digraphs
- Kings and heirs: a characterization of the \((2, 2)\)-domination graphs of tournaments
- Toppling kings in a tournament by introducing new kings
- On king-serf pair in tournaments
This page was built for publication: Kings in strong tournaments.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829005)