Name
Abstract | ||
|---|---|---|
An n -partite tournament, n ≥2, or multipartite tournament is an oriented graph obtained by orienting each edge of a complete n -partite graph. The cycle structure of multipartite tournaments is investigated and properties of vertices with maximum score are studied. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0095-8956(91)90069-V | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
multipartite tournament | Complete graph,Discrete mathematics,Graph,Tournament,Combinatorics,Multipartite,Vertex (geometry),Vertex (graph theory),Turán graph,Multipartite graph,Mathematics | Journal |
Volume | Issue | ISSN |
52 | 2 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
14 | 2.58 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wayne D. Goddard | 1 | 21 | 3.90 |
| Grzegorz Kubicki | 2 | 95 | 15.16 |
| Ortrud R. Oellermann | 3 | 424 | 61.05 |
| Songlin Tian | 4 | 19 | 3.51 |