On the public citation graph

The radii of n-partite tournaments

0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02476378openalex-snapshot
On dominance relations and the structure of animal societies: III The condition for a score structure
inferredcites →https://doi.org/10.1112/jlms/s2-14.2.277openalex-snapshot
Diconnected Orientations and a Conjecture of Las Vergnas
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199808)28:4<171::aid-jgt1>3.0.co;2-gopenalex-snapshot
Generalizations of tournaments: A survey
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(200003)33:3<177::aid-jgt8>3.0.co;2-1openalex-snapshot
Kings in semicomplete multipartite digraphs
inferred← citeshttps://doi.org/10.1002/jgt.20426openalex-snapshot
Kings in locally semicomplete digraphs
inferred← citeshttps://doi.org/10.1002/jgt.22726openalex-snapshot
Kings in multipartite hypertournaments
inferred← citeshttps://doi.org/10.1002/jgt.3190190405openalex-snapshot
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
inferred← citeshttps://doi.org/10.1002/jgt.v63:4openalex-snapshot
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_7openalex-snapshot
Semicomplete Multipartite Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_32openalex-snapshot
Parameterized Algorithms for Directed Maximum Leaf Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_29openalex-snapshot
On the Complexity of Kings
inferred← citeshttps://doi.org/10.1007/s00373-019-02045-yopenalex-snapshot
Kings in Bipartite Hypertournaments
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00169-jopenalex-snapshot
Kings in multipartite tournaments
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00051-wopenalex-snapshot
Number of 4-kings in bipartite tournaments with no 3-kings
inferred← citeshttps://doi.org/10.1016/j.disc.2004.10.013openalex-snapshot
On the kings and kings-of-kings in semicomplete multipartite digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.11.095openalex-snapshot
3-Kings in 3-partite tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2006.04.023openalex-snapshot
On the 3-kings and 4-kings in multipartite tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2007.03.053openalex-snapshot
Multipartite tournaments: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2007.06.002openalex-snapshot
On semicomplete multipartite digraphs whose king sets are semicomplete digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.06.001openalex-snapshot
Toppling kings in multipartite tournaments by introducing new kings
inferred← citeshttps://doi.org/10.1016/j.disc.2012.05.005openalex-snapshot
k -kernels in k -transitive and k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2013.08.007openalex-snapshot
On the existence and number of (k+1) -kings in k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112252openalex-snapshot
Proximity and remoteness in directed and undirected graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00131-8openalex-snapshot
Kings in bipartite tournaments
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00244-0openalex-snapshot
The number of kings in a multipartite tournament
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00179-9openalex-snapshot
Kings in quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1080/09728600.2011.12088942openalex-snapshot
K-Kernels in Multipartite Tournaments
inferred← citeshttps://doi.org/10.2478/s12175-008-0073-4openalex-snapshot
Kings and serfs in oriented graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.